./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.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 3bce72d965225c899cc1d9d72de2e0303c4153823aa0ea4c81aa443b535f20b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:30:08,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:30:08,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:30:08,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:30:08,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:30:08,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:30:08,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:30:08,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:30:08,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:30:08,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:30:08,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:30:08,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:30:08,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:30:08,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:30:08,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:30:08,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:30:08,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:30:08,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:30:08,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:30:08,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:30:08,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:30:08,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:30:08,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:30:08,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:30:08,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:30:08,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:30:08,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:30:08,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:30:08,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:30:08,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:30:08,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:30:08,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:30:08,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:08,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:30:08,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:30:08,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:30:08,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:30:08,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:30:08,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:30:08,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:30:08,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:30:08,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:30:08,490 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 -> 3bce72d965225c899cc1d9d72de2e0303c4153823aa0ea4c81aa443b535f20b5 [2024-10-13 00:30:08,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:30:08,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:30:08,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:30:08,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:30:08,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:30:08,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:10,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:30:10,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:30:10,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:10,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60bbd3cd/258f0584136147ba9a5e21cfd64d8093/FLAG69cd8e941 [2024-10-13 00:30:10,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60bbd3cd/258f0584136147ba9a5e21cfd64d8093 [2024-10-13 00:30:10,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:30:10,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:30:10,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:10,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:30:10,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:30:10,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca34ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10, skipping insertion in model container [2024-10-13 00:30:10,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:30:10,602 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i[913,926] [2024-10-13 00:30:10,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:10,666 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:30:10,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i[913,926] [2024-10-13 00:30:10,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:10,734 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:30:10,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10 WrapperNode [2024-10-13 00:30:10,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:10,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:10,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:30:10,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:30:10,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,837 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-13 00:30:10,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:10,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:30:10,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:30:10,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:30:10,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,923 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-10-13 00:30:10,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:30:10,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:30:10,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:30:10,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:30:10,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (1/1) ... [2024-10-13 00:30:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:10,997 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-10-13 00:30:10,999 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-10-13 00:30:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:30:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:30:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:30:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:30:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:30:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:30:11,131 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:30:11,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:30:11,491 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 00:30:11,491 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:30:11,525 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:30:11,525 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:30:11,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:11 BoogieIcfgContainer [2024-10-13 00:30:11,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:30:11,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:30:11,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:30:11,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:30:11,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:30:10" (1/3) ... [2024-10-13 00:30:11,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4960ffeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:11, skipping insertion in model container [2024-10-13 00:30:11,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:10" (2/3) ... [2024-10-13 00:30:11,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4960ffeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:11, skipping insertion in model container [2024-10-13 00:30:11,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:11" (3/3) ... [2024-10-13 00:30:11,534 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:11,548 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:30:11,548 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:30:11,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:30:11,605 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;@1652f811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:30:11,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:30:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:30:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 00:30:11,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:11,622 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:11,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1511057870, now seen corresponding path program 1 times [2024-10-13 00:30:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889968356] [2024-10-13 00:30:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:30:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:30:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:30:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 00:30:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 00:30:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 00:30:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:30:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 00:30:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:30:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 00:30:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:30:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 00:30:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:30:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:30:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:30:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:30:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:30:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:30:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:30:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:30:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:30:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:30:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:30:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:30:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:30:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:30:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889968356] [2024-10-13 00:30:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889968356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:30:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387371131] [2024-10-13 00:30:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:30:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:30:12,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:30:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:12,064 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:30:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:12,107 INFO L93 Difference]: Finished difference Result 159 states and 274 transitions. [2024-10-13 00:30:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:30:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-10-13 00:30:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:12,117 INFO L225 Difference]: With dead ends: 159 [2024-10-13 00:30:12,117 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 00:30:12,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10-13 00:30:12,124 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:12,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:30:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 00:30:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 00:30:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:30:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-10-13 00:30:12,170 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 153 [2024-10-13 00:30:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-10-13 00:30:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:30:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-10-13 00:30:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 00:30:12,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:12,176 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:12,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:30:12,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -757247234, now seen corresponding path program 1 times [2024-10-13 00:30:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:12,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398625378] [2024-10-13 00:30:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:30:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:30:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:30:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 00:30:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 00:30:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 00:30:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:30:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 00:30:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:30:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 00:30:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:30:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 00:30:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:30:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:30:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:30:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:30:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:30:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:30:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:30:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:30:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:30:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:30:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:30:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:30:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 00:30:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:30:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398625378] [2024-10-13 00:30:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398625378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:30:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535495286] [2024-10-13 00:30:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:30:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:12,959 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-10-13 00:30:12,961 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-10-13 00:30:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:13,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:30:13,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-13 00:30:13,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:30:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 00:30:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535495286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:30:13,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:30:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 00:30:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928816488] [2024-10-13 00:30:13,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:30:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:30:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:30:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:30:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:30:13,644 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:30:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:13,926 INFO L93 Difference]: Finished difference Result 165 states and 248 transitions. [2024-10-13 00:30:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:30:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 153 [2024-10-13 00:30:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:13,930 INFO L225 Difference]: With dead ends: 165 [2024-10-13 00:30:13,930 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 00:30:13,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:30:13,933 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 153 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:13,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 363 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:30:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 00:30:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-10-13 00:30:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:30:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-10-13 00:30:13,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 153 [2024-10-13 00:30:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:13,951 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-10-13 00:30:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:30:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-10-13 00:30:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 00:30:13,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:13,959 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:13,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:30:14,159 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-10-13 00:30:14,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -699988932, now seen corresponding path program 1 times [2024-10-13 00:30:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52924010] [2024-10-13 00:30:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:30:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:30:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:30:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 00:30:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 00:30:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 00:30:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:30:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 00:30:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:30:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 00:30:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:30:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 00:30:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:30:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:30:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:30:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:30:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:30:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:30:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:30:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:30:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:30:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:30:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:30:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-10-13 00:30:15,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:30:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52924010] [2024-10-13 00:30:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52924010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:30:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99236364] [2024-10-13 00:30:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:15,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:30:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:15,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:30:15,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 00:30:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:15,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 00:30:15,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 510 proven. 27 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-10-13 00:30:15,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:30:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 36 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-10-13 00:30:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99236364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:30:16,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:30:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 33 [2024-10-13 00:30:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002405621] [2024-10-13 00:30:16,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:30:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 00:30:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:30:16,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 00:30:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 00:30:16,749 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 8 states have call predecessors, (37), 8 states have call successors, (37) [2024-10-13 00:30:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:19,459 INFO L93 Difference]: Finished difference Result 462 states and 658 transitions. [2024-10-13 00:30:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 00:30:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 8 states have call predecessors, (37), 8 states have call successors, (37) Word has length 153 [2024-10-13 00:30:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:19,463 INFO L225 Difference]: With dead ends: 462 [2024-10-13 00:30:19,463 INFO L226 Difference]: Without dead ends: 380 [2024-10-13 00:30:19,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=830, Invalid=2592, Unknown=0, NotChecked=0, Total=3422 [2024-10-13 00:30:19,466 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 603 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:19,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1231 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 00:30:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-13 00:30:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 154. [2024-10-13 00:30:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 107 states have internal predecessors, (137), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:30:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2024-10-13 00:30:19,504 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 153 [2024-10-13 00:30:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:19,505 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2024-10-13 00:30:19,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 8 states have call predecessors, (37), 8 states have call successors, (37) [2024-10-13 00:30:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2024-10-13 00:30:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 00:30:19,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:19,509 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:19,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 00:30:19,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 00:30:19,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1711106182, now seen corresponding path program 1 times [2024-10-13 00:30:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597257743] [2024-10-13 00:30:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:30:19,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188225084] [2024-10-13 00:30:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:19,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:30:19,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:19,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:30:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 00:30:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:30:19,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:30:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:30:20,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:30:20,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:30:20,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:30:20,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 00:30:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:30:20,229 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:30:20,321 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:30:20,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:30:20 BoogieIcfgContainer [2024-10-13 00:30:20,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:30:20,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:30:20,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:30:20,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:30:20,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:11" (3/4) ... [2024-10-13 00:30:20,328 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:30:20,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:30:20,329 INFO L158 Benchmark]: Toolchain (without parser) took 9930.28ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 97.7MB in the beginning and 149.8MB in the end (delta: -52.0MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,329 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 122.7MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:30:20,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.39ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 81.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.53ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 136.8MB in the end (delta: -55.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,330 INFO L158 Benchmark]: Boogie Preprocessor took 118.41ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 131.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,330 INFO L158 Benchmark]: RCFGBuilder took 567.68ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 103.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,331 INFO L158 Benchmark]: TraceAbstraction took 8796.55ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 103.2MB in the beginning and 149.8MB in the end (delta: -46.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-10-13 00:30:20,331 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 283.1MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:30:20,332 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.15ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 122.7MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.39ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 81.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.53ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 136.8MB in the end (delta: -55.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.41ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 131.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 567.68ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 103.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8796.55ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 103.2MB in the beginning and 149.8MB in the end (delta: -46.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 283.1MB. Free memory is still 149.8MB. 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 someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] float var_1_4 = 127.6; [L25] double var_1_5 = 100000000000000.5; [L26] double var_1_6 = 100000000000000.7; [L27] double var_1_7 = 256.75; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 1; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] signed char var_1_12 = 0; [L33] signed char var_1_13 = 2; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_16 = 10; [L36] unsigned char var_1_18 = 4; [L37] unsigned char var_1_19 = 8; [L38] unsigned char var_1_20 = 8; [L39] unsigned short int var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned short int var_1_24 = 34649; [L42] unsigned char last_1_var_1_8 = 0; [L43] unsigned short int last_1_var_1_21 = 128; [L44] unsigned char last_1_var_1_22 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L138] last_1_var_1_8 = var_1_8 [L139] last_1_var_1_21 = var_1_21 [L140] last_1_var_1_22 = var_1_22 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_float() [L99] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L133] var_1_24 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L151] RET updateVariables() [L152] CALL step() [L48] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L59] COND FALSE !(var_1_1 > ((var_1_1 * var_1_5) + 5.3)) [L66] var_1_8 = var_1_11 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L68] signed long int stepLocal_0 = (last_1_var_1_22 / var_1_16) * last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L69] COND FALSE !(last_1_var_1_21 < stepLocal_0) [L72] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L74] EXPR var_1_18 << var_1_14 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L74] signed long int stepLocal_3 = var_1_18 << var_1_14; [L75] EXPR var_1_14 | var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L75] signed long int stepLocal_2 = (var_1_14 | var_1_18) / (var_1_24 - 1); [L76] COND FALSE !(var_1_19 == stepLocal_3) [L83] var_1_22 = 64 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L85] COND FALSE !(((- var_1_1) / 24.75) < var_1_6) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L92] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L93] COND FALSE !(var_1_8 && stepLocal_1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L143-L144] return ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 779 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 1712 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1342 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2406 IncrementalHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 370 mSDtfsCounter, 2406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 761 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 3 MinimizatonAttempts, 230 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1071 NumberOfCodeBlocks, 1071 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 3203 SizeOfPredicates, 8 NumberOfNonLiveVariables, 685 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 7503/7728 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-10-13 00:30:20,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.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 3bce72d965225c899cc1d9d72de2e0303c4153823aa0ea4c81aa443b535f20b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:30:22,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:30:22,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:30:22,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:30:22,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:30:22,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:30:22,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:30:22,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:30:22,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:30:22,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:30:22,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:30:22,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:30:22,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:30:22,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:30:22,592 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:30:22,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:30:22,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:30:22,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:30:22,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:30:22,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:30:22,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:30:22,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:30:22,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:30:22,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:30:22,597 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:30:22,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:30:22,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:30:22,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:30:22,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:30:22,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:30:22,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:30:22,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:30:22,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:30:22,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:30:22,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:22,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:30:22,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:30:22,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:30:22,609 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:30:22,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:30:22,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:30:22,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:30:22,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:30:22,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:30:22,610 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:30:22,610 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 -> 3bce72d965225c899cc1d9d72de2e0303c4153823aa0ea4c81aa443b535f20b5 [2024-10-13 00:30:22,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:30:22,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:30:22,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:30:22,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:30:22,950 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:30:22,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:24,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:30:24,647 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:30:24,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:24,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc42c43a/2d962ece3163492eb8f8689a8fc6f97d/FLAG6bad9a22e [2024-10-13 00:30:25,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc42c43a/2d962ece3163492eb8f8689a8fc6f97d [2024-10-13 00:30:25,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:30:25,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:30:25,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:25,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:30:25,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:30:25,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795cb996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25, skipping insertion in model container [2024-10-13 00:30:25,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:30:25,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i[913,926] [2024-10-13 00:30:25,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:25,295 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:30:25,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-88.i[913,926] [2024-10-13 00:30:25,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:25,355 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:30:25,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25 WrapperNode [2024-10-13 00:30:25,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:25,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:25,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:30:25,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:30:25,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,410 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-10-13 00:30:25,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:25,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:30:25,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:30:25,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:30:25,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,445 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:30:25,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:30:25,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:30:25,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:30:25,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:30:25,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (1/1) ... [2024-10-13 00:30:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:25,501 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-10-13 00:30:25,503 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-10-13 00:30:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:30:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:30:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:30:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:30:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:30:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:30:25,622 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:30:25,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:30:38,451 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:30:38,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:30:38,512 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:30:38,513 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:30:38,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:38 BoogieIcfgContainer [2024-10-13 00:30:38,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:30:38,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:30:38,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:30:38,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:30:38,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:30:25" (1/3) ... [2024-10-13 00:30:38,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726af445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:38, skipping insertion in model container [2024-10-13 00:30:38,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:25" (2/3) ... [2024-10-13 00:30:38,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726af445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:38, skipping insertion in model container [2024-10-13 00:30:38,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:38" (3/3) ... [2024-10-13 00:30:38,522 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-88.i [2024-10-13 00:30:38,535 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:30:38,536 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:30:38,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:30:38,610 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;@44b1af1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:30:38,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:30:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:30:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 00:30:38,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:38,630 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:38,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:38,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1976480159, now seen corresponding path program 1 times [2024-10-13 00:30:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:30:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078347339] [2024-10-13 00:30:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:38,651 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-10-13 00:30:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:30:38,655 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-10-13 00:30:38,656 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-10-13 00:30:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:39,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:30:39,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-13 00:30:39,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:30:39,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:30:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078347339] [2024-10-13 00:30:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078347339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:30:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102739791] [2024-10-13 00:30:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:30:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:30:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:30:39,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:39,473 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:30:43,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:30:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:43,764 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2024-10-13 00:30:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:30:43,842 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-10-13 00:30:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:43,848 INFO L225 Difference]: With dead ends: 127 [2024-10-13 00:30:43,848 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 00:30:43,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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-10-13 00:30:43,852 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:43,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 00:30:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 00:30:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 00:30:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:30:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-13 00:30:43,888 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 148 [2024-10-13 00:30:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:43,888 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-13 00:30:43,889 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:30:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-13 00:30:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 00:30:43,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:43,891 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:30:43,919 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-10-13 00:30:44,092 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-10-13 00:30:44,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1766368595, now seen corresponding path program 1 times [2024-10-13 00:30:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:30:44,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663966566] [2024-10-13 00:30:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:44,094 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-10-13 00:30:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:30:44,097 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-10-13 00:30:44,113 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-10-13 00:30:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:44,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 00:30:44,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-13 00:30:47,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:30:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 00:30:50,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:30:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663966566] [2024-10-13 00:30:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663966566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:30:50,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:30:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 00:30:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679062673] [2024-10-13 00:30:50,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:30:50,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 00:30:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:30:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 00:30:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:30:50,436 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:30:57,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:31:01,882 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-10-13 00:31:05,893 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-10-13 00:31:09,903 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-10-13 00:31:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:09,911 INFO L93 Difference]: Finished difference Result 133 states and 200 transitions. [2024-10-13 00:31:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:31:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 148 [2024-10-13 00:31:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:10,040 INFO L225 Difference]: With dead ends: 133 [2024-10-13 00:31:10,040 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 00:31:10,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:31:10,042 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:10,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 208 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2024-10-13 00:31:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 00:31:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-13 00:31:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:31:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-10-13 00:31:10,074 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 148 [2024-10-13 00:31:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-10-13 00:31:10,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:31:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-10-13 00:31:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 00:31:10,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:10,078 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:31:10,123 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-10-13 00:31:10,278 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-10-13 00:31:10,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:10,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1766428177, now seen corresponding path program 1 times [2024-10-13 00:31:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:31:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12268002] [2024-10-13 00:31:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:10,281 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-10-13 00:31:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:31:10,284 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-10-13 00:31:10,286 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-10-13 00:31:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:11,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 00:31:11,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:31:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 00:31:20,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:31:23,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:31:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12268002] [2024-10-13 00:31:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12268002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:31:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [175216502] [2024-10-13 00:31:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:31:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:31:24,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:31:24,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 00:31:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:26,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 00:31:26,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:31:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 00:31:35,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:31:38,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [175216502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:31:38,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:31:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-13 00:31:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442914716] [2024-10-13 00:31:38,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:31:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 00:31:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:31:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 00:31:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:31:38,388 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)