./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i -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 a8a0e3ca76ba9c99a9eeacbcba757dabf36e2fe6d91ed4d761aaa087e685149d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:29:18,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:29:18,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:29:18,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:29:18,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:29:18,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:29:18,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:29:18,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:29:18,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:29:18,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:29:18,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:29:18,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:29:18,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:29:18,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:29:18,151 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:29:18,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:29:18,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:29:18,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:29:18,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:29:18,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:29:18,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:29:18,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:29:18,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:29:18,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:29:18,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:29:18,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:29:18,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:29:18,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:29:18,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:29:18,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:29:18,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:29:18,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:29:18,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:29:18,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:29:18,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:29:18,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:29:18,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:29:18,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:29:18,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:29:18,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:29:18,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:29:18,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:29:18,159 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 -> a8a0e3ca76ba9c99a9eeacbcba757dabf36e2fe6d91ed4d761aaa087e685149d [2024-11-10 06:29:18,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:29:18,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:29:18,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:29:18,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:29:18,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:29:18,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:19,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:29:19,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:29:19,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:19,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25022e01b/a1a29badad8c4615a5e79d7ce6d900fc/FLAGc54978649 [2024-11-10 06:29:19,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25022e01b/a1a29badad8c4615a5e79d7ce6d900fc [2024-11-10 06:29:19,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:29:19,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:29:19,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:29:19,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:29:19,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:29:19,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:29:19" (1/1) ... [2024-11-10 06:29:19,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1daea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:19, skipping insertion in model container [2024-11-10 06:29:19,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:29:19" (1/1) ... [2024-11-10 06:29:19,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:29:20,118 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i[913,926] [2024-11-10 06:29:20,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:29:20,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:29:20,189 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i[913,926] [2024-11-10 06:29:20,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:29:20,256 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:29:20,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20 WrapperNode [2024-11-10 06:29:20,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:29:20,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:29:20,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:29:20,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:29:20,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,320 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-10 06:29:20,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:29:20,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:29:20,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:29:20,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:29:20,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:29:20,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:29:20,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:29:20,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:29:20,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:29:20,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (1/1) ... [2024-11-10 06:29:20,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:29:20,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:29:20,418 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-10 06:29:20,421 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-10 06:29:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:29:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:29:20,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:29:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:29:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:29:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:29:20,542 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:29:20,544 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:29:20,807 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 06:29:20,807 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:29:20,826 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:29:20,827 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:29:20,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:29:20 BoogieIcfgContainer [2024-11-10 06:29:20,827 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:29:20,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:29:20,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:29:20,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:29:20,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:29:19" (1/3) ... [2024-11-10 06:29:20,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e1211e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:29:20, skipping insertion in model container [2024-11-10 06:29:20,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:20" (2/3) ... [2024-11-10 06:29:20,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e1211e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:29:20, skipping insertion in model container [2024-11-10 06:29:20,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:29:20" (3/3) ... [2024-11-10 06:29:20,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:20,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:29:20,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:29:20,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:29:20,916 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;@31ef7115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:29:20,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:29:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 06:29:20,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:20,933 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:20,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1985777398, now seen corresponding path program 1 times [2024-11-10 06:29:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:29:20,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108858374] [2024-11-10 06:29:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:29:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:29:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:29:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:29:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:29:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:29:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:29:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 06:29:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:29:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:29:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:29:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 06:29:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:29:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 06:29:21,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:29:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108858374] [2024-11-10 06:29:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108858374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:29:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:29:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:29:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117848721] [2024-11-10 06:29:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:29:21,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:29:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:29:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:29:21,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:29:21,260 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 06:29:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:29:21,282 INFO L93 Difference]: Finished difference Result 106 states and 169 transitions. [2024-11-10 06:29:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:29:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-10 06:29:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:29:21,319 INFO L225 Difference]: With dead ends: 106 [2024-11-10 06:29:21,320 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 06:29:21,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:29:21,345 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:29:21,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:29:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 06:29:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 06:29:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 06:29:21,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 89 [2024-11-10 06:29:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:29:21,383 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 06:29:21,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 06:29:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 06:29:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 06:29:21,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:21,386 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:21,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:29:21,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:21,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1290978280, now seen corresponding path program 1 times [2024-11-10 06:29:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:29:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027336176] [2024-11-10 06:29:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:29:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:29:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:29:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:29:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:29:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:29:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:29:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 06:29:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:29:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:29:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:29:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 06:29:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:29:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 06:29:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:29:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027336176] [2024-11-10 06:29:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027336176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:29:21,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:29:21,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:29:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994356457] [2024-11-10 06:29:21,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:29:21,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:29:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:29:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:29:21,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:29:21,833 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 06:29:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:29:21,959 INFO L93 Difference]: Finished difference Result 100 states and 143 transitions. [2024-11-10 06:29:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:29:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-10 06:29:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:29:21,963 INFO L225 Difference]: With dead ends: 100 [2024-11-10 06:29:21,964 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 06:29:21,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:29:21,966 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 75 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:29:21,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:29:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 06:29:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 06:29:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-10 06:29:21,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 89 [2024-11-10 06:29:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:29:21,981 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-10 06:29:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 06:29:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-10 06:29:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 06:29:21,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:21,985 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:21,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:29:21,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1969438016, now seen corresponding path program 1 times [2024-11-10 06:29:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:29:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497407200] [2024-11-10 06:29:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:29:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:29:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300446979] [2024-11-10 06:29:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:29:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:29:22,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:29:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:29:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:29:22,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:29:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:29:22,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:29:22,273 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:29:22,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:29:22,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:29:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:29:22,480 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:29:22,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:29:22,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:29:22 BoogieIcfgContainer [2024-11-10 06:29:22,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:29:22,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:29:22,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:29:22,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:29:22,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:29:20" (3/4) ... [2024-11-10 06:29:22,566 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:29:22,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:29:22,568 INFO L158 Benchmark]: Toolchain (without parser) took 2621.08ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 86.9MB in the beginning and 65.2MB in the end (delta: 21.7MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,568 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:29:22,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.10ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 127.1MB in the end (delta: -40.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.90ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 127.1MB in the beginning and 169.7MB in the end (delta: -42.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,569 INFO L158 Benchmark]: Boogie Preprocessor took 60.59ms. Allocated memory is still 199.2MB. Free memory was 169.7MB in the beginning and 165.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,570 INFO L158 Benchmark]: IcfgBuilder took 445.01ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 145.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,570 INFO L158 Benchmark]: TraceAbstraction took 1733.07ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 65.2MB in the end (delta: 80.4MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2024-11-10 06:29:22,570 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 199.2MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:29:22,572 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.16ms. Allocated memory is still 159.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.10ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 127.1MB in the end (delta: -40.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.90ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 127.1MB in the beginning and 169.7MB in the end (delta: -42.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.59ms. Allocated memory is still 199.2MB. Free memory was 169.7MB in the beginning and 165.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 445.01ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 145.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1733.07ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 65.2MB in the end (delta: 80.4MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 199.2MB. Free memory is still 65.2MB. 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: 19]: 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 131, overapproximation of someBinaryFLOATComparisonOperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] signed long int last_1_var_1_1 = -256; [L40] signed short int last_1_var_1_5 = -256; [L41] unsigned char last_1_var_1_10 = 0; [L42] unsigned short int last_1_var_1_19 = 5; [L43] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 [L125] last_1_var_1_5 = var_1_5 [L126] last_1_var_1_10 = var_1_10 [L127] last_1_var_1_19 = var_1_19 [L128] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L102] var_1_7 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L103] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L104] var_1_8 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L105] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L108] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L108] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L111] var_1_14 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L112] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L114] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L116] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L116] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L117] var_1_16 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L118] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L121] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L121] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L139] RET updateVariables() [L140] CALL step() [L47] signed long int stepLocal_2 = last_1_var_1_5; [L48] unsigned char stepLocal_1 = last_1_var_1_10; [L49] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L50] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L55] COND TRUE last_1_var_1_1 >= stepLocal_2 [L56] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L61] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L62] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L67] var_1_22 = last_1_var_1_22 [L68] var_1_23 = var_1_14 [L69] unsigned char stepLocal_5 = var_1_10; [L70] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L71] COND TRUE var_1_22 < stepLocal_4 [L72] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L80] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L81] COND TRUE ! (var_1_23 <= var_1_7) [L82] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L90] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L91] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L94] COND FALSE !((var_1_7 - var_1_8) > var_1_12) [L97] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 132 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 528/528 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-10 06:29:22,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i -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 a8a0e3ca76ba9c99a9eeacbcba757dabf36e2fe6d91ed4d761aaa087e685149d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:29:24,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:29:24,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:29:24,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:29:24,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:29:24,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:29:24,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:29:24,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:29:24,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:29:24,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:29:24,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:29:24,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:29:24,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:29:24,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:29:24,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:29:24,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:29:24,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:29:24,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:29:24,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:29:24,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:29:24,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:29:24,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:29:24,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:29:24,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:29:24,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:29:24,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:29:24,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:29:24,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:29:24,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:29:24,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:29:24,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:29:24,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:29:24,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:29:24,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:29:24,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:29:24,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:29:24,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:29:24,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:29:24,709 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:29:24,709 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:29:24,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:29:24,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:29:24,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:29:24,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:29:24,714 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 -> a8a0e3ca76ba9c99a9eeacbcba757dabf36e2fe6d91ed4d761aaa087e685149d [2024-11-10 06:29:24,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:29:24,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:29:24,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:29:24,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:29:24,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:29:24,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:26,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:29:26,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:29:26,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:26,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed61ad523/8a19b4c34dff456d8d859e193e9a6e83/FLAG335ffe911 [2024-11-10 06:29:26,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed61ad523/8a19b4c34dff456d8d859e193e9a6e83 [2024-11-10 06:29:26,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:29:26,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:29:26,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:29:26,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:29:26,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:29:26,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:29:26" (1/1) ... [2024-11-10 06:29:26,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf88be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:26, skipping insertion in model container [2024-11-10 06:29:26,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:29:26" (1/1) ... [2024-11-10 06:29:27,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:29:27,198 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i[913,926] [2024-11-10 06:29:27,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:29:27,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:29:27,293 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/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-25.i[913,926] [2024-11-10 06:29:27,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:29:27,347 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:29:27,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27 WrapperNode [2024-11-10 06:29:27,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:29:27,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:29:27,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:29:27,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:29:27,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,402 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-10 06:29:27,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:29:27,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:29:27,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:29:27,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:29:27,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,445 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:29:27,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:29:27,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:29:27,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:29:27,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:29:27,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (1/1) ... [2024-11-10 06:29:27,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:29:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:29:27,507 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-10 06:29:27,509 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-10 06:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:29:27,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:29:27,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:29:27,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:29:27,621 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:29:27,623 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:29:29,123 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 06:29:29,131 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:29:29,142 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:29:29,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:29:29,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:29:29 BoogieIcfgContainer [2024-11-10 06:29:29,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:29:29,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:29:29,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:29:29,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:29:29,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:29:26" (1/3) ... [2024-11-10 06:29:29,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d45014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:29:29, skipping insertion in model container [2024-11-10 06:29:29,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:29:27" (2/3) ... [2024-11-10 06:29:29,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d45014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:29:29, skipping insertion in model container [2024-11-10 06:29:29,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:29:29" (3/3) ... [2024-11-10 06:29:29,150 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-25.i [2024-11-10 06:29:29,172 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:29:29,172 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:29:29,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:29:29,228 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;@594020de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:29:29,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:29:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 06:29:29,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:29,242 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:29,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1985777398, now seen corresponding path program 1 times [2024-11-10 06:29:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:29:29,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232774610] [2024-11-10 06:29:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:29,258 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-10 06:29:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:29:29,262 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-10 06:29:29,263 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-10 06:29:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:29,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:29:29,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:29:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-10 06:29:29,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:29:29,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:29:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232774610] [2024-11-10 06:29:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232774610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:29:29,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:29:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:29:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850315244] [2024-11-10 06:29:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:29:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:29:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:29:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:29:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:29:29,557 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 06:29:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:29:29,576 INFO L93 Difference]: Finished difference Result 106 states and 169 transitions. [2024-11-10 06:29:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:29:29,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-10 06:29:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:29:29,585 INFO L225 Difference]: With dead ends: 106 [2024-11-10 06:29:29,585 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 06:29:29,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:29:29,590 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:29:29,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:29:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 06:29:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 06:29:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 06:29:29,626 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 89 [2024-11-10 06:29:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:29:29,626 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 06:29:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 06:29:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 06:29:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 06:29:29,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:29,629 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:29,639 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:29:29,830 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-10 06:29:29,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1290978280, now seen corresponding path program 1 times [2024-11-10 06:29:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:29:29,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645911394] [2024-11-10 06:29:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:29,832 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-10 06:29:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:29:29,834 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-10 06:29:29,835 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-10 06:29:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:30,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:29:30,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:29:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 06:29:30,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:29:30,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:29:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645911394] [2024-11-10 06:29:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645911394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:29:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:29:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:29:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353543046] [2024-11-10 06:29:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:29:30,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:29:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:29:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:29:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:29:30,275 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 06:29:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:29:30,733 INFO L93 Difference]: Finished difference Result 100 states and 143 transitions. [2024-11-10 06:29:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:29:30,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-10 06:29:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:29:30,748 INFO L225 Difference]: With dead ends: 100 [2024-11-10 06:29:30,748 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 06:29:30,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:29:30,750 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:29:30,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:29:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 06:29:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 06:29:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 06:29:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-10 06:29:30,758 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 89 [2024-11-10 06:29:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:29:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-10 06:29:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 06:29:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-10 06:29:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 06:29:30,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:29:30,761 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:29:30,775 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 (3)] Ended with exit code 0 [2024-11-10 06:29:30,962 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-10 06:29:30,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:29:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:29:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1969438016, now seen corresponding path program 1 times [2024-11-10 06:29:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:29:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697987642] [2024-11-10 06:29:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:29:30,965 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-10 06:29:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:29:30,969 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-10 06:29:30,970 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-10 06:29:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:29:31,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 06:29:31,251 INFO L278 TraceCheckSpWp]: Computing forward predicates...