./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:32:10,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:32:10,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:32:10,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:32:10,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:32:10,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:32:10,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:32:10,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:32:10,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:32:10,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:32:10,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:32:10,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:32:10,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:32:10,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:32:10,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:32:10,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:32:10,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:32:10,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:32:10,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:32:10,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:32:10,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:32:10,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:32:10,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:32:10,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:32:10,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:32:10,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:32:10,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:32:10,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:32:10,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:32:10,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:32:10,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:32:10,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:32:10,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:10,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:32:10,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:32:10,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:32:10,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:32:10,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:32:10,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:32:10,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:32:10,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:32:10,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:32:10,370 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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2024-11-12 06:32:10,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:32:10,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:32:10,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:32:10,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:32:10,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:32:10,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:12,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:32:12,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:32:12,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:12,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d563c8d1c/bc12168b2e1745aabba7cfe407bdf3ca/FLAG2bf44fe2b [2024-11-12 06:32:12,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d563c8d1c/bc12168b2e1745aabba7cfe407bdf3ca [2024-11-12 06:32:12,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:32:12,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:32:12,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:12,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:32:12,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:32:12,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:12" (1/1) ... [2024-11-12 06:32:12,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641f150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:12, skipping insertion in model container [2024-11-12 06:32:12,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:12" (1/1) ... [2024-11-12 06:32:12,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:32:13,169 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_operatoramount_amount25_file-72.i[915,928] [2024-11-12 06:32:13,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:13,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:32:13,238 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_operatoramount_amount25_file-72.i[915,928] [2024-11-12 06:32:13,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:13,287 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:32:13,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13 WrapperNode [2024-11-12 06:32:13,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:13,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:13,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:32:13,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:32:13,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,342 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-12 06:32:13,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:13,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:32:13,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:32:13,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:32:13,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,384 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-12 06:32:13,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:32:13,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:32:13,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:32:13,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:32:13,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (1/1) ... [2024-11-12 06:32:13,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:32:13,454 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-12 06:32:13,462 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-12 06:32:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:32:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:32:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:32:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:32:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:32:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:32:13,590 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:32:13,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:32:13,896 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:32:13,896 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:32:13,931 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:32:13,932 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:32:13,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:13 BoogieIcfgContainer [2024-11-12 06:32:13,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:32:13,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:32:13,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:32:13,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:32:13,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:32:12" (1/3) ... [2024-11-12 06:32:13,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa8483a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:13, skipping insertion in model container [2024-11-12 06:32:13,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:13" (2/3) ... [2024-11-12 06:32:13,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa8483a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:13, skipping insertion in model container [2024-11-12 06:32:13,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:13" (3/3) ... [2024-11-12 06:32:13,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:13,964 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:32:13,964 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:32:14,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:32:14,027 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;@7aeffd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:32:14,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:32:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:32:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:32:14,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:14,044 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:32:14,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101837, now seen corresponding path program 1 times [2024-11-12 06:32:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692427565] [2024-11-12 06:32:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:32:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:32:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:32:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 06:32:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 06:32:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 06:32:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 06:32:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 06:32:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 06:32:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:32:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 06:32:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:32:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 06:32:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:32:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 06:32:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:32:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:32:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 06:32:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 06:32:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 06:32:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 06:32:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:32:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:32:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 06:32:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:32:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692427565] [2024-11-12 06:32:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692427565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:14,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:14,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:32:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551476377] [2024-11-12 06:32:14,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:14,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:32:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:32:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:32:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:32:14,566 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 06:32:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:14,602 INFO L93 Difference]: Finished difference Result 117 states and 199 transitions. [2024-11-12 06:32:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:32:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-12 06:32:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:14,614 INFO L225 Difference]: With dead ends: 117 [2024-11-12 06:32:14,614 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 06:32:14,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-12 06:32:14,622 INFO L435 NwaCegarLoop]: 84 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, 84 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-12 06:32:14,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:32:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 06:32:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 06:32:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:32:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-12 06:32:14,690 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2024-11-12 06:32:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:14,690 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-12 06:32:14,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 06:32:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-12 06:32:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:32:14,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:14,697 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:32:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:32:14,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1696472987, now seen corresponding path program 1 times [2024-11-12 06:32:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329909251] [2024-11-12 06:32:14,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:32:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:32:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:32:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 06:32:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 06:32:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 06:32:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 06:32:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 06:32:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 06:32:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:32:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 06:32:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:32:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 06:32:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:32:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 06:32:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:32:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:32:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 06:32:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 06:32:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 06:32:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 06:32:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:32:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:32:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 06:32:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:32:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329909251] [2024-11-12 06:32:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329909251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:32:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136133107] [2024-11-12 06:32:15,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:32:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:32:15,390 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-12 06:32:15,393 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-12 06:32:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:15,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:32:15,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-12 06:32:15,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:32:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 06:32:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136133107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:32:16,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:32:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 06:32:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080690431] [2024-11-12 06:32:16,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:32:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:32:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:32:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:32:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:32:16,203 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 06:32:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:16,471 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-12 06:32:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 06:32:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2024-11-12 06:32:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:16,479 INFO L225 Difference]: With dead ends: 121 [2024-11-12 06:32:16,479 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 06:32:16,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:32:16,482 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:32:16,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 119 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:32:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 06:32:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-12 06:32:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:32:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-12 06:32:16,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2024-11-12 06:32:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:16,511 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-12 06:32:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 06:32:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-12 06:32:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:32:16,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:16,514 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:32:16,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:32:16,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:32:16,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1789147683, now seen corresponding path program 1 times [2024-11-12 06:32:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:32:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526958114] [2024-11-12 06:32:16,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:32:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:32:16,772 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:32:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:32:16,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:32:16,896 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:32:16,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:32:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:32:16,910 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:32:17,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:32:17,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:32:17 BoogieIcfgContainer [2024-11-12 06:32:17,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:32:17,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:32:17,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:32:17,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:32:17,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:13" (3/4) ... [2024-11-12 06:32:17,023 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:32:17,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:32:17,026 INFO L158 Benchmark]: Toolchain (without parser) took 4084.11ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 102.6MB in the beginning and 95.5MB in the end (delta: 7.0MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,026 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:17,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.85ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 87.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,028 INFO L158 Benchmark]: Boogie Preprocessor took 65.67ms. Allocated memory is still 157.3MB. Free memory was 84.7MB in the beginning and 82.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,028 INFO L158 Benchmark]: RCFGBuilder took 523.11ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 181.1MB in the end (delta: -98.9MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,029 INFO L158 Benchmark]: TraceAbstraction took 3082.47ms. Allocated memory is still 211.8MB. Free memory was 180.3MB in the beginning and 95.5MB in the end (delta: 84.8MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-12 06:32:17,029 INFO L158 Benchmark]: Witness Printer took 6.58ms. Allocated memory is still 211.8MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:32:17,034 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.28ms. Allocated memory is still 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.85ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 87.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.67ms. Allocated memory is still 157.3MB. Free memory was 84.7MB in the beginning and 82.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.11ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 181.1MB in the end (delta: -98.9MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3082.47ms. Allocated memory is still 211.8MB. Free memory was 180.3MB in the beginning and 95.5MB in the end (delta: 84.8MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 6.58ms. Allocated memory is still 211.8MB. Free memory is still 95.5MB. 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 102, overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 128.875; [L24] double var_1_3 = 24.5; [L25] double var_1_4 = 8.2; [L26] double var_1_5 = 10.05; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned long int var_1_10 = 2; [L32] signed char var_1_11 = -16; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = 4; [L36] double var_1_15 = 256.4; [L37] float var_1_16 = 0.25; [L38] double var_1_17 = 100000000000.2; [L39] double var_1_18 = 50.5; [L40] double var_1_19 = 9.5; VAL [isInitial=0, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_2=1031/8, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] var_1_4 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] var_1_5 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] var_1_12 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] var_1_14 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] var_1_16 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L94] var_1_18 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L48] COND FALSE !((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L55] COND TRUE var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L56] var_1_1 = (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) ? ((var_1_3 >= var_1_4) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) var_1_17))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=4, var_1_12=-59, var_1_13=63, var_1_14=6, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 140 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3949/4048 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-12 06:32:17,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:32:19,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:32:19,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:32:19,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:32:19,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:32:19,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:32:19,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:32:19,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:32:19,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:32:19,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:32:19,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:32:19,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:32:19,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:32:19,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:32:19,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:32:19,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:32:19,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:32:19,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:32:19,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:32:19,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:32:19,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:32:19,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:32:19,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:32:19,663 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:32:19,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:32:19,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:32:19,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:32:19,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:32:19,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:32:19,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:32:19,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:32:19,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:32:19,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:32:19,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:32:19,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:19,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:32:19,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:32:19,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:32:19,668 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:32:19,668 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:32:19,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:32:19,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:32:19,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:32:19,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:32:19,669 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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2024-11-12 06:32:20,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:32:20,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:32:20,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:32:20,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:32:20,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:32:20,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:21,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:32:22,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:32:22,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:22,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d69bcae9/630643f3ec1e43a38d67b72ec125d2cc/FLAG4ac379e1a [2024-11-12 06:32:22,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d69bcae9/630643f3ec1e43a38d67b72ec125d2cc [2024-11-12 06:32:22,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:32:22,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:32:22,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:22,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:32:22,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:32:22,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126efcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22, skipping insertion in model container [2024-11-12 06:32:22,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:32:22,360 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_operatoramount_amount25_file-72.i[915,928] [2024-11-12 06:32:22,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:22,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:32:22,475 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_operatoramount_amount25_file-72.i[915,928] [2024-11-12 06:32:22,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:32:22,531 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:32:22,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22 WrapperNode [2024-11-12 06:32:22,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:32:22,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:22,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:32:22,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:32:22,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,607 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-12 06:32:22,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:32:22,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:32:22,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:32:22,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:32:22,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,658 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-12 06:32:22,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:32:22,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:32:22,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:32:22,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:32:22,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (1/1) ... [2024-11-12 06:32:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:32:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:32:22,743 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-12 06:32:22,750 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-12 06:32:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:32:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:32:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:32:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:32:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:32:22,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:32:22,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:32:22,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:32:39,190 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:32:39,193 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:32:39,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:32:39,212 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:32:39,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:39 BoogieIcfgContainer [2024-11-12 06:32:39,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:32:39,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:32:39,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:32:39,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:32:39,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:32:22" (1/3) ... [2024-11-12 06:32:39,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbf64e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:39, skipping insertion in model container [2024-11-12 06:32:39,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:32:22" (2/3) ... [2024-11-12 06:32:39,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbf64e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:32:39, skipping insertion in model container [2024-11-12 06:32:39,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:32:39" (3/3) ... [2024-11-12 06:32:39,221 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2024-11-12 06:32:39,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:32:39,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:32:39,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:32:39,328 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;@2d5661e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:32:39,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:32:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:32:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:32:39,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:39,360 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:32:39,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:39,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101837, now seen corresponding path program 1 times [2024-11-12 06:32:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845186525] [2024-11-12 06:32:39,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:39,392 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-12 06:32:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:39,396 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-12 06:32:39,398 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-12 06:32:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:40,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:32:40,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2024-11-12 06:32:40,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:32:40,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845186525] [2024-11-12 06:32:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845186525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:32:40,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:32:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:32:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11973196] [2024-11-12 06:32:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:32:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:32:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:32:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:32:40,775 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 06:32:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:32:40,808 INFO L93 Difference]: Finished difference Result 117 states and 199 transitions. [2024-11-12 06:32:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:32:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-12 06:32:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:32:40,817 INFO L225 Difference]: With dead ends: 117 [2024-11-12 06:32:40,817 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 06:32:40,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-12 06:32:40,823 INFO L435 NwaCegarLoop]: 84 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, 84 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-12 06:32:40,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:32:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 06:32:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 06:32:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:32:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-12 06:32:40,870 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2024-11-12 06:32:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:32:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-12 06:32:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 06:32:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-12 06:32:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:32:40,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:32:40,876 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:32:40,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:32:41,076 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-12 06:32:41,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:32:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:32:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1696472987, now seen corresponding path program 1 times [2024-11-12 06:32:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:32:41,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153967597] [2024-11-12 06:32:41,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:32:41,080 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-12 06:32:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:32:41,082 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-12 06:32:41,084 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-12 06:32:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:32:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:32:42,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:32:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-12 06:32:45,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:32:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 06:32:49,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:32:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153967597] [2024-11-12 06:32:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153967597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:32:49,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:32:49,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 06:32:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190074357] [2024-11-12 06:32:49,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:32:49,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:32:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:32:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:32:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:32:49,609 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 06:32:54,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:32:58,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:33:02,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:33:06,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:33:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:33:06,994 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-12 06:33:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 06:33:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2024-11-12 06:33:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:33:07,179 INFO L225 Difference]: With dead ends: 121 [2024-11-12 06:33:07,179 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 06:33:07,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:33:07,181 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:33:07,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 16.7s Time] [2024-11-12 06:33:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 06:33:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-12 06:33:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:33:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-12 06:33:07,198 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2024-11-12 06:33:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:33:07,199 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-12 06:33:07,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 06:33:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-12 06:33:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 06:33:07,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:33:07,202 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:33:07,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:33:07,402 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-12 06:33:07,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:33:07,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:33:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1789147683, now seen corresponding path program 1 times [2024-11-12 06:33:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:33:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991546055] [2024-11-12 06:33:07,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:33:07,405 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-12 06:33:07,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:33:07,410 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-12 06:33:07,411 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-12 06:33:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:33:08,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 06:33:08,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:33:28,384 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:33:36,848 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)