./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:55:22,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:55:23,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:55:23,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:55:23,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:55:23,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:55:23,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:55:23,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:55:23,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:55:23,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:55:23,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:55:23,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:55:23,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:55:23,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:55:23,109 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:55:23,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:55:23,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:55:23,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:55:23,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:55:23,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:55:23,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:55:23,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:55:23,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:55:23,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:55:23,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:55:23,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:55:23,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:55:23,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:55:23,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:55:23,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:55:23,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:55:23,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:55:23,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:55:23,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:55:23,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:55:23,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:55:23,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:55:23,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:55:23,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:55:23,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:55:23,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:55:23,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:55:23,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-11 17:55:23,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:55:23,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:55:23,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:55:23,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:55:23,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:55:23,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:24,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:55:25,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:55:25,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:25,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2518a91/5b33fa0ce50044279c854a7a35e0dd07/FLAGfbb1140a8 [2024-11-11 17:55:25,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2518a91/5b33fa0ce50044279c854a7a35e0dd07 [2024-11-11 17:55:25,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:55:25,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:55:25,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:55:25,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:55:25,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:55:25,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368cfd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25, skipping insertion in model container [2024-11-11 17:55:25,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:55:25,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-11 17:55:25,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:55:25,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:55:25,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-11 17:55:25,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:55:25,434 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:55:25,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25 WrapperNode [2024-11-11 17:55:25,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:55:25,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:55:25,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:55:25,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:55:25,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,478 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2024-11-11 17:55:25,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:55:25,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:55:25,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:55:25,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:55:25,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,525 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-11 17:55:25,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:55:25,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:55:25,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:55:25,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:55:25,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (1/1) ... [2024-11-11 17:55:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:55:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:55:25,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:55:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:55:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:55:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:55:25,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 17:55:25,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 17:55:25,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 17:55:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-11 17:55:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-11 17:55:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-11 17:55:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 17:55:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 17:55:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 17:55:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-11 17:55:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-11 17:55:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-11 17:55:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:55:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:55:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 17:55:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 17:55:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 17:55:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 17:55:25,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:55:25,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:55:25,958 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-11 17:55:25,958 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:55:25,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:55:25,970 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 17:55:25,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:55:25 BoogieIcfgContainer [2024-11-11 17:55:25,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:55:25,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:55:25,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:55:25,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:55:25,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:55:25" (1/3) ... [2024-11-11 17:55:25,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efce81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:55:25, skipping insertion in model container [2024-11-11 17:55:25,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:25" (2/3) ... [2024-11-11 17:55:25,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efce81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:55:25, skipping insertion in model container [2024-11-11 17:55:25,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:55:25" (3/3) ... [2024-11-11 17:55:25,978 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:25,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:55:25,992 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:55:26,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:55:26,050 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27e33226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:55:26,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:55:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 17:55:26,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:26,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:26,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash -9620842, now seen corresponding path program 1 times [2024-11-11 17:55:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:55:26,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003308048] [2024-11-11 17:55:26,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:55:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:55:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:55:26,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:55:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003308048] [2024-11-11 17:55:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003308048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:55:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:55:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:55:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359169679] [2024-11-11 17:55:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:55:26,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:55:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:55:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:55:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:55:26,379 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:55:26,425 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-11-11 17:55:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:55:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-11 17:55:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:55:26,436 INFO L225 Difference]: With dead ends: 37 [2024-11-11 17:55:26,436 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 17:55:26,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:55:26,454 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:55:26,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 17:55:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 17:55:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-11 17:55:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-11 17:55:26,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2024-11-11 17:55:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:55:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-11 17:55:26,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-11 17:55:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 17:55:26,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:26,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:55:26,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1149101563, now seen corresponding path program 1 times [2024-11-11 17:55:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:55:26,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442479949] [2024-11-11 17:55:26,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:55:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:55:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:55:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:55:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442479949] [2024-11-11 17:55:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442479949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:55:26,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:55:26,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 17:55:26,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58998620] [2024-11-11 17:55:26,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:55:26,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 17:55:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:55:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 17:55:26,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:55:26,675 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:55:26,708 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-11 17:55:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 17:55:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-11 17:55:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:55:26,709 INFO L225 Difference]: With dead ends: 33 [2024-11-11 17:55:26,709 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 17:55:26,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:55:26,711 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:55:26,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 17:55:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 17:55:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-11 17:55:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-11 17:55:26,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 17 [2024-11-11 17:55:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:55:26,718 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-11 17:55:26,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-11 17:55:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 17:55:26,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:26,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:26,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:55:26,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1694700504, now seen corresponding path program 1 times [2024-11-11 17:55:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:55:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516876497] [2024-11-11 17:55:26,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:55:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:55:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 17:55:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:55:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516876497] [2024-11-11 17:55:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516876497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:55:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:55:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 17:55:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346771885] [2024-11-11 17:55:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:55:26,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 17:55:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:55:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 17:55:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:55:26,872 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:55:26,900 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-11-11 17:55:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 17:55:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-11 17:55:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:55:26,901 INFO L225 Difference]: With dead ends: 29 [2024-11-11 17:55:26,901 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 17:55:26,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:55:26,905 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:55:26,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 17:55:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 17:55:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-11 17:55:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-11 17:55:26,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2024-11-11 17:55:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:55:26,913 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-11 17:55:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-11 17:55:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 17:55:26,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:26,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:26,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:55:26,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:26,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1711711165, now seen corresponding path program 1 times [2024-11-11 17:55:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:55:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398581964] [2024-11-11 17:55:26,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:55:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 17:55:26,958 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 17:55:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 17:55:27,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 17:55:27,002 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 17:55:27,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:55:27,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:55:27,007 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-11 17:55:27,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:55:27,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:55:27 BoogieIcfgContainer [2024-11-11 17:55:27,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:55:27,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:55:27,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:55:27,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:55:27,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:55:25" (3/4) ... [2024-11-11 17:55:27,041 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 17:55:27,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:55:27,043 INFO L158 Benchmark]: Toolchain (without parser) took 1933.83ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 101.1MB in the end (delta: 38.2MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:55:27,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.29ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 125.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.89ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 124.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,044 INFO L158 Benchmark]: Boogie Preprocessor took 68.79ms. Allocated memory is still 169.9MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,044 INFO L158 Benchmark]: RCFGBuilder took 421.26ms. Allocated memory is still 169.9MB. Free memory was 121.3MB in the beginning and 108.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,045 INFO L158 Benchmark]: TraceAbstraction took 1065.73ms. Allocated memory is still 169.9MB. Free memory was 107.3MB in the beginning and 101.1MB in the end (delta: 6.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-11 17:55:27,045 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 169.9MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:55:27,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.29ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 125.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.89ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 124.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.79ms. Allocated memory is still 169.9MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.26ms. Allocated memory is still 169.9MB. Free memory was 121.3MB in the beginning and 108.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1065.73ms. Allocated memory is still 169.9MB. Free memory was 107.3MB in the beginning and 101.1MB in the end (delta: 6.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 169.9MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 96]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; VAL [__return_104=0, __return_main=0] [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i VAL [__return_104=0, __return_main=0] [L45] EXPR (inv__A_u.i) & 2146435072 VAL [__return_104=0, __return_main=0, inv__xi_u={5:0}] [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, inv__cond=1, inv__xi=2145386511] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, inv__xi=2145386511] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, inv__xi=2145386511] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, inv____CPAchecker_TMP_0=0, inv__xi=2145386511] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, inv__cond=0, inv__xi=2145386512] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386512, __return_main=0] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386512, __return_main=0] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386512, __return_main=0, main____CPAchecker_TMP_1=0] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__VERIFIER_assert__cond=0, __return_104=2145386512, __return_main=0] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386512, __return_main=0] [L96] reach_error() VAL [__return_104=2145386512, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 87 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 17:55:27,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:55:29,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:55:29,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 17:55:29,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:55:29,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:55:29,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:55:29,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:55:29,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:55:29,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:55:29,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:55:29,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:55:29,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:55:29,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:55:29,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:55:29,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:55:29,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:55:29,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:55:29,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:55:29,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:55:29,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:55:29,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:55:29,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:55:29,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:55:29,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 17:55:29,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 17:55:29,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:55:29,420 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 17:55:29,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:55:29,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:55:29,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:55:29,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:55:29,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:55:29,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:55:29,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:55:29,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:55:29,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:55:29,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:55:29,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:55:29,424 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 17:55:29,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 17:55:29,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:55:29,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:55:29,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:55:29,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:55:29,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-11 17:55:29,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:55:29,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:55:29,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:55:29,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:55:29,802 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:55:29,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:31,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:55:31,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:55:31,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:31,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37052ce75/e4065fbbb69e48c19e4c8552a60700ca/FLAG6112e6373 [2024-11-11 17:55:31,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37052ce75/e4065fbbb69e48c19e4c8552a60700ca [2024-11-11 17:55:31,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:55:31,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:55:31,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:55:31,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:55:31,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:55:31,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:55:31" (1/1) ... [2024-11-11 17:55:31,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6929d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:31, skipping insertion in model container [2024-11-11 17:55:31,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:55:31" (1/1) ... [2024-11-11 17:55:32,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:55:32,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-11 17:55:32,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:55:32,250 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:55:32,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-11 17:55:32,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:55:32,307 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:55:32,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32 WrapperNode [2024-11-11 17:55:32,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:55:32,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:55:32,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:55:32,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:55:32,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,354 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2024-11-11 17:55:32,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:55:32,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:55:32,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:55:32,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:55:32,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,392 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-11 17:55:32,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:55:32,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:55:32,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:55:32,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:55:32,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (1/1) ... [2024-11-11 17:55:32,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:55:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:55:32,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:55:32,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:55:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:55:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-11 17:55:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 17:55:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:55:32,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-11 17:55:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-11 17:55:32,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:55:32,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:55:37,064 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-11 17:55:37,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:55:37,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:55:37,077 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 17:55:37,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:55:37 BoogieIcfgContainer [2024-11-11 17:55:37,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:55:37,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:55:37,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:55:37,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:55:37,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:55:31" (1/3) ... [2024-11-11 17:55:37,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bf3ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:55:37, skipping insertion in model container [2024-11-11 17:55:37,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:55:32" (2/3) ... [2024-11-11 17:55:37,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bf3ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:55:37, skipping insertion in model container [2024-11-11 17:55:37,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:55:37" (3/3) ... [2024-11-11 17:55:37,088 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-11 17:55:37,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:55:37,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:55:37,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:55:37,171 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20ab3b77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:55:37,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:55:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 17:55:37,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:37,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:37,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:37,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2024-11-11 17:55:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 17:55:37,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607618170] [2024-11-11 17:55:37,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:37,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:55:37,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 17:55:37,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 17:55:37,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 17:55:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:55:37,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:55:37,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:55:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:55:37,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:55:37,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 17:55:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607618170] [2024-11-11 17:55:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607618170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:55:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:55:37,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:55:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133869766] [2024-11-11 17:55:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:55:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:55:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 17:55:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:55:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:55:37,481 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:41,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:55:45,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:55:49,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:55:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:55:49,950 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-11 17:55:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:55:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 17:55:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:55:50,018 INFO L225 Difference]: With dead ends: 32 [2024-11-11 17:55:50,018 INFO L226 Difference]: Without dead ends: 19 [2024-11-11 17:55:50,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:55:50,023 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:55:50,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-11-11 17:55:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-11 17:55:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-11 17:55:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-11 17:55:50,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2024-11-11 17:55:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:55:50,048 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-11 17:55:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-11 17:55:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 17:55:50,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:55:50,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:55:50,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 17:55:50,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:55:50,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:55:50,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:55:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2024-11-11 17:55:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 17:55:50,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323481065] [2024-11-11 17:55:50,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:55:50,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:55:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 17:55:50,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 17:55:50,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 17:55:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:55:50,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 17:55:50,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:55:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:55:50,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:55:50,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 17:55:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323481065] [2024-11-11 17:55:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323481065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:55:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:55:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:55:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018143880] [2024-11-11 17:55:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:55:50,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:55:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 17:55:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:55:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:55:50,940 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:55:55,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:55:59,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:56:03,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:56:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:56:11,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-11 17:56:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:56:11,428 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-11 17:56:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:56:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 17:56:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:56:11,495 INFO L225 Difference]: With dead ends: 28 [2024-11-11 17:56:11,495 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 17:56:11,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:56:11,497 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:56:11,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 20.5s Time] [2024-11-11 17:56:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 17:56:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-11 17:56:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:56:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-11 17:56:11,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2024-11-11 17:56:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:56:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-11 17:56:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:56:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-11 17:56:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 17:56:11,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:56:11,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:56:11,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-11 17:56:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:56:11,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:56:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:56:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2024-11-11 17:56:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 17:56:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797970052] [2024-11-11 17:56:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:56:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:56:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 17:56:11,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 17:56:11,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 17:56:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:56:12,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 17:56:12,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:56:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 17:56:12,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:56:12,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 17:56:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797970052] [2024-11-11 17:56:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797970052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:56:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:56:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:56:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456813988] [2024-11-11 17:56:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:56:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:56:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 17:56:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:56:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:56:12,390 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:56:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:56:12,487 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-11 17:56:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:56:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 17:56:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:56:12,489 INFO L225 Difference]: With dead ends: 24 [2024-11-11 17:56:12,489 INFO L226 Difference]: Without dead ends: 20 [2024-11-11 17:56:12,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:56:12,492 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:56:12,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 17:56:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-11 17:56:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-11 17:56:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:56:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-11 17:56:12,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-11 17:56:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:56:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-11 17:56:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:56:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-11 17:56:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 17:56:12,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:56:12,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:56:12,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 17:56:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:56:12,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:56:12,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:56:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2024-11-11 17:56:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 17:56:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153198973] [2024-11-11 17:56:12,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:56:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 17:56:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 17:56:12,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 17:56:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 17:56:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:56:13,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 17:56:13,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:56:14,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-11 17:56:14,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 17:56:14,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2024-11-11 17:56:22,792 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 17:56:31,041 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 17:56:39,312 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 17:56:47,575 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 17:56:55,825 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 17:56:59,904 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) v_arrayElimCell_1))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-11 17:57:08,143 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)