./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_loopvsstraightlinecode_50-while_file-47.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_loopvsstraightlinecode_50-while_file-47.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 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:41:19,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:41:19,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:41:19,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:41:19,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:41:19,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:41:19,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:41:19,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:41:19,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:41:19,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:41:19,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:41:19,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:41:19,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:41:19,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:41:19,713 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:41:19,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:41:19,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:41:19,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:41:19,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:41:19,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:41:19,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:41:19,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:41:19,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:41:19,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:41:19,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:41:19,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:41:19,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:41:19,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:41:19,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:41:19,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:41:19,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:41:19,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:41:19,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:41:19,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:41:19,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:41:19,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:41:19,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:41:19,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:41:19,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:41:19,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:41:19,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:41:19,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:41:19,728 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 -> 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 [2024-10-13 04:41:19,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:41:20,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:41:20,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:41:20,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:41:20,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:41:20,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:41:21,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:41:21,836 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:41:21,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:41:21,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d98ae8f4/8c07a32ceb5a400092ef924ce17775ca/FLAG2ef7fa1c5 [2024-10-13 04:41:22,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d98ae8f4/8c07a32ceb5a400092ef924ce17775ca [2024-10-13 04:41:22,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:41:22,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:41:22,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:41:22,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:41:22,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:41:22,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2b9c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22, skipping insertion in model container [2024-10-13 04:41:22,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:41:22,388 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-10-13 04:41:22,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:41:22,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:41:22,477 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-10-13 04:41:22,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:41:22,528 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:41:22,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22 WrapperNode [2024-10-13 04:41:22,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:41:22,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:41:22,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:41:22,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:41:22,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,604 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-10-13 04:41:22,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:41:22,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:41:22,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:41:22,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:41:22,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,662 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 04:41:22,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:41:22,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:41:22,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:41:22,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:41:22,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (1/1) ... [2024-10-13 04:41:22,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:41:22,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:22,741 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 04:41:22,748 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 04:41:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:41:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:41:22,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:41:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:41:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:41:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:41:22,892 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:41:22,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:41:23,348 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-13 04:41:23,348 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:41:23,388 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:41:23,389 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:41:23,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:41:23 BoogieIcfgContainer [2024-10-13 04:41:23,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:41:23,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:41:23,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:41:23,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:41:23,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:41:22" (1/3) ... [2024-10-13 04:41:23,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431a517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:41:23, skipping insertion in model container [2024-10-13 04:41:23,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:22" (2/3) ... [2024-10-13 04:41:23,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431a517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:41:23, skipping insertion in model container [2024-10-13 04:41:23,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:41:23" (3/3) ... [2024-10-13 04:41:23,401 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:41:23,417 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:41:23,418 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:41:23,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:41:23,490 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;@30c107e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:41:23,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:41:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:41:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 04:41:23,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:23,511 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:23,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:23,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 150894031, now seen corresponding path program 1 times [2024-10-13 04:41:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666695355] [2024-10-13 04:41:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:41:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666695355] [2024-10-13 04:41:24,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666695355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:41:24,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:41:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:41:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906882221] [2024-10-13 04:41:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:41:24,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:41:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:41:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:41:24,096 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:41:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:24,144 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2024-10-13 04:41:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:41:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2024-10-13 04:41:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:24,155 INFO L225 Difference]: With dead ends: 163 [2024-10-13 04:41:24,155 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 04:41:24,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 04:41:24,163 INFO L432 NwaCegarLoop]: 120 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, 120 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 04:41:24,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:41:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 04:41:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 04:41:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:41:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-13 04:41:24,216 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 136 [2024-10-13 04:41:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:24,216 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-13 04:41:24,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:41:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-13 04:41:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:41:24,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:24,222 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:41:24,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 303884647, now seen corresponding path program 1 times [2024-10-13 04:41:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749817447] [2024-10-13 04:41:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:41:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749817447] [2024-10-13 04:41:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749817447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:41:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:41:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:41:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163066986] [2024-10-13 04:41:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:41:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:41:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:41:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:41:25,026 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:25,422 INFO L93 Difference]: Finished difference Result 352 states and 532 transitions. [2024-10-13 04:41:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:41:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-13 04:41:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:25,432 INFO L225 Difference]: With dead ends: 352 [2024-10-13 04:41:25,432 INFO L226 Difference]: Without dead ends: 272 [2024-10-13 04:41:25,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:41:25,435 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 292 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:25,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 495 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:41:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-13 04:41:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 171. [2024-10-13 04:41:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:41:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2024-10-13 04:41:25,525 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 137 [2024-10-13 04:41:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2024-10-13 04:41:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2024-10-13 04:41:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:41:25,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:25,531 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:41:25,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:25,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1690260059, now seen corresponding path program 1 times [2024-10-13 04:41:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308866304] [2024-10-13 04:41:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:41:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308866304] [2024-10-13 04:41:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308866304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:41:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:41:26,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:41:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300625522] [2024-10-13 04:41:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:41:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:41:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:41:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:41:26,157 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:26,372 INFO L93 Difference]: Finished difference Result 332 states and 499 transitions. [2024-10-13 04:41:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:41:26,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-13 04:41:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:26,375 INFO L225 Difference]: With dead ends: 332 [2024-10-13 04:41:26,375 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 04:41:26,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:41:26,377 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 84 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:26,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 329 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:41:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 04:41:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2024-10-13 04:41:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:41:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-10-13 04:41:26,418 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 137 [2024-10-13 04:41:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-10-13 04:41:26,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-10-13 04:41:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 04:41:26,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:26,421 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:41:26,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1026358380, now seen corresponding path program 1 times [2024-10-13 04:41:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390792491] [2024-10-13 04:41:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:41:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390792491] [2024-10-13 04:41:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390792491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:41:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:41:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:41:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981891608] [2024-10-13 04:41:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:41:26,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:41:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:41:26,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:41:26,886 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:27,283 INFO L93 Difference]: Finished difference Result 387 states and 584 transitions. [2024-10-13 04:41:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:41:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-10-13 04:41:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:27,287 INFO L225 Difference]: With dead ends: 387 [2024-10-13 04:41:27,287 INFO L226 Difference]: Without dead ends: 307 [2024-10-13 04:41:27,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:41:27,291 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 166 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:27,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 350 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:41:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-13 04:41:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 252. [2024-10-13 04:41:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 185 states have (on average 1.345945945945946) internal successors, (249), 185 states have internal predecessors, (249), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-13 04:41:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2024-10-13 04:41:27,343 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 139 [2024-10-13 04:41:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:27,343 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2024-10-13 04:41:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2024-10-13 04:41:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 04:41:27,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:27,345 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:41:27,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1295163565, now seen corresponding path program 1 times [2024-10-13 04:41:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396100560] [2024-10-13 04:41:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-13 04:41:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396100560] [2024-10-13 04:41:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396100560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:41:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741885012] [2024-10-13 04:41:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:28,380 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 04:41:28,382 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 04:41:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:28,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 04:41:28,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:41:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-13 04:41:29,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:41:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-10-13 04:41:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741885012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:41:31,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:41:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-10-13 04:41:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156449340] [2024-10-13 04:41:31,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:41:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 04:41:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 04:41:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2024-10-13 04:41:31,208 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand has 32 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-13 04:41:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:36,816 INFO L93 Difference]: Finished difference Result 845 states and 1188 transitions. [2024-10-13 04:41:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-13 04:41:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 140 [2024-10-13 04:41:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:36,824 INFO L225 Difference]: With dead ends: 845 [2024-10-13 04:41:36,824 INFO L226 Difference]: Without dead ends: 652 [2024-10-13 04:41:36,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2656, Invalid=10000, Unknown=0, NotChecked=0, Total=12656 [2024-10-13 04:41:36,831 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 896 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:36,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 2016 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 04:41:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-10-13 04:41:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 375. [2024-10-13 04:41:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 295 states have (on average 1.3220338983050848) internal successors, (390), 296 states have internal predecessors, (390), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:41:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 520 transitions. [2024-10-13 04:41:36,891 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 520 transitions. Word has length 140 [2024-10-13 04:41:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:36,892 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 520 transitions. [2024-10-13 04:41:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-13 04:41:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 520 transitions. [2024-10-13 04:41:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 04:41:36,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:36,894 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:36,911 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 04:41:37,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:37,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:37,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash -172089564, now seen corresponding path program 1 times [2024-10-13 04:41:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:37,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756197579] [2024-10-13 04:41:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:41:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756197579] [2024-10-13 04:41:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756197579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:41:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:41:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:41:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236646323] [2024-10-13 04:41:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:41:37,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:41:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:41:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:41:37,355 INFO L87 Difference]: Start difference. First operand 375 states and 520 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:37,523 INFO L93 Difference]: Finished difference Result 757 states and 1054 transitions. [2024-10-13 04:41:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:41:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-10-13 04:41:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:37,528 INFO L225 Difference]: With dead ends: 757 [2024-10-13 04:41:37,528 INFO L226 Difference]: Without dead ends: 586 [2024-10-13 04:41:37,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:41:37,530 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 104 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:37,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 417 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:41:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-13 04:41:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 409. [2024-10-13 04:41:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 329 states have (on average 1.303951367781155) internal successors, (429), 330 states have internal predecessors, (429), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:41:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 559 transitions. [2024-10-13 04:41:37,603 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 559 transitions. Word has length 140 [2024-10-13 04:41:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:37,604 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 559 transitions. [2024-10-13 04:41:37,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:41:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 559 transitions. [2024-10-13 04:41:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 04:41:37,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:37,606 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:41:37,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash -389263065, now seen corresponding path program 1 times [2024-10-13 04:41:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479825456] [2024-10-13 04:41:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:41:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:41:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:41:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:41:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:41:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:41:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:41:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:41:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:41:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:41:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:41:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:41:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:41:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:41:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:41:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:41:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:41:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:41:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:41:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:41:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:41:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 04:41:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479825456] [2024-10-13 04:41:38,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479825456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:41:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111388907] [2024-10-13 04:41:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:38,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:38,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:38,340 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 04:41:38,341 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 04:41:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:39,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 04:41:39,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:41:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 188 proven. 102 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-13 04:41:39,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:41:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 04:41:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111388907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:41:40,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:41:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 19 [2024-10-13 04:41:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454589423] [2024-10-13 04:41:40,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:41:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 04:41:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 04:41:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:41:40,179 INFO L87 Difference]: Start difference. First operand 409 states and 559 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 5 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2024-10-13 04:41:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:40,957 INFO L93 Difference]: Finished difference Result 725 states and 991 transitions. [2024-10-13 04:41:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 04:41:40,958 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 5 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) Word has length 141 [2024-10-13 04:41:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:40,963 INFO L225 Difference]: With dead ends: 725 [2024-10-13 04:41:40,963 INFO L226 Difference]: Without dead ends: 387 [2024-10-13 04:41:40,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-13 04:41:40,966 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 233 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:40,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 850 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:41:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-13 04:41:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2024-10-13 04:41:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 296 states have (on average 1.287162162162162) internal successors, (381), 297 states have internal predecessors, (381), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:41:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 511 transitions. [2024-10-13 04:41:41,026 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 511 transitions. Word has length 141 [2024-10-13 04:41:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:41,028 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 511 transitions. [2024-10-13 04:41:41,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 5 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2024-10-13 04:41:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 511 transitions. [2024-10-13 04:41:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 04:41:41,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:41,030 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:41,047 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 04:41:41,231 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,SelfDestructingSolverStorable6 [2024-10-13 04:41:41,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 234481960, now seen corresponding path program 1 times [2024-10-13 04:41:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591861710] [2024-10-13 04:41:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:41:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033513283] [2024-10-13 04:41:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:41,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:41,330 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 04:41:41,332 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 04:41:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:41:41,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 04:41:41,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:41:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-13 04:41:42,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:41:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:41:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591861710] [2024-10-13 04:41:42,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:41:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033513283] [2024-10-13 04:41:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033513283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:41:42,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:41:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 04:41:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682693328] [2024-10-13 04:41:42,468 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 04:41:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:41:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:41:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:41:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:41:42,469 INFO L87 Difference]: Start difference. First operand 376 states and 511 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:41:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:41:42,809 INFO L93 Difference]: Finished difference Result 683 states and 934 transitions. [2024-10-13 04:41:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:41:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-10-13 04:41:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:41:42,820 INFO L225 Difference]: With dead ends: 683 [2024-10-13 04:41:42,820 INFO L226 Difference]: Without dead ends: 384 [2024-10-13 04:41:42,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:41:42,822 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 46 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:41:42,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 532 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:41:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-13 04:41:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2024-10-13 04:41:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 298 states have (on average 1.2852348993288591) internal successors, (383), 299 states have internal predecessors, (383), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:41:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 513 transitions. [2024-10-13 04:41:42,881 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 513 transitions. Word has length 142 [2024-10-13 04:41:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:41:42,883 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 513 transitions. [2024-10-13 04:41:42,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:41:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 513 transitions. [2024-10-13 04:41:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 04:41:42,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:41:42,887 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:42,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 04:41:43,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:43,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:41:43,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:41:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 291740262, now seen corresponding path program 1 times [2024-10-13 04:41:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:41:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680115555] [2024-10-13 04:41:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:41:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:41:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584186056] [2024-10-13 04:41:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:41:43,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:43,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:41:43,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 04:41:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:41:43,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:41:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:41:43,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:41:43,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:41:43,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:41:43,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 04:41:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:41:43,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:41:44,063 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:41:44,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:41:44 BoogieIcfgContainer [2024-10-13 04:41:44,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:41:44,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:41:44,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:41:44,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:41:44,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:41:23" (3/4) ... [2024-10-13 04:41:44,068 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:41:44,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:41:44,069 INFO L158 Benchmark]: Toolchain (without parser) took 21891.63ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 176.5MB in the beginning and 268.5MB in the end (delta: -92.0MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,069 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:41:44,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.28ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 160.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.86ms. Allocated memory is still 207.6MB. Free memory was 160.6MB in the beginning and 155.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,070 INFO L158 Benchmark]: Boogie Preprocessor took 98.87ms. Allocated memory is still 207.6MB. Free memory was 155.5MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,070 INFO L158 Benchmark]: RCFGBuilder took 684.98ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 119.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,071 INFO L158 Benchmark]: TraceAbstraction took 20672.78ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 119.1MB in the beginning and 268.5MB in the end (delta: -149.4MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-10-13 04:41:44,071 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 446.7MB. Free memory is still 268.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:41:44,072 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.21ms. Allocated memory is still 130.0MB. Free memory was 91.7MB in the beginning and 91.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.28ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 160.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.86ms. Allocated memory is still 207.6MB. Free memory was 160.6MB in the beginning and 155.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.87ms. Allocated memory is still 207.6MB. Free memory was 155.5MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 684.98ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 119.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20672.78ms. Allocated memory was 207.6MB in the beginning and 446.7MB in the end (delta: 239.1MB). Free memory was 119.1MB in the beginning and 268.5MB in the end (delta: -149.4MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 446.7MB. Free memory is still 268.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of bitwiseOr at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=-49153, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-65538, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=-65538, var_1_5=-49153, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1831 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1821 mSDsluCounter, 5109 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4030 mSDsCounter, 669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4382 IncrementalHoareTripleChecker+Invalid, 5051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 669 mSolverCounterUnsat, 1079 mSDtfsCounter, 4382 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1305 GetRequests, 1141 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4349 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=6, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 657 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1662 ConstructedInterpolants, 0 QuantifiedInterpolants, 9454 SizeOfPredicates, 13 NumberOfNonLiveVariables, 968 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 9621/10080 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 04:41:44,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-while_file-47.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 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:41:46,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:41:46,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:41:46,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:41:46,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:41:46,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:41:46,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:41:46,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:41:46,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:41:46,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:41:46,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:41:46,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:41:46,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:41:46,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:41:46,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:41:46,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:41:46,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:41:46,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:41:46,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:41:46,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:41:46,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:41:46,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:41:46,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:41:46,514 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:41:46,514 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:41:46,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:41:46,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:41:46,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:41:46,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:41:46,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:41:46,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:41:46,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:41:46,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:41:46,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:41:46,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:41:46,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:41:46,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:41:46,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:41:46,519 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:41:46,520 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:41:46,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:41:46,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:41:46,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:41:46,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:41:46,522 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:41:46,522 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 -> 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 [2024-10-13 04:41:46,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:41:46,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:41:46,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:41:46,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:41:46,907 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:41:46,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:41:48,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:41:48,696 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:41:48,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:41:48,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc71677/b996bd3259884afa87c2500184db086f/FLAG42936ed81 [2024-10-13 04:41:49,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc71677/b996bd3259884afa87c2500184db086f [2024-10-13 04:41:49,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:41:49,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:41:49,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:41:49,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:41:49,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:41:49,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49, skipping insertion in model container [2024-10-13 04:41:49,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:41:49,290 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-10-13 04:41:49,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:41:49,392 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:41:49,407 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-10-13 04:41:49,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:41:49,456 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:41:49,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49 WrapperNode [2024-10-13 04:41:49,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:41:49,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:41:49,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:41:49,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:41:49,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,505 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-13 04:41:49,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:41:49,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:41:49,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:41:49,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:41:49,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,540 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 04:41:49,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:41:49,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:41:49,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:41:49,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:41:49,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (1/1) ... [2024-10-13 04:41:49,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:41:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:41:49,609 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 04:41:49,612 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 04:41:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:41:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:41:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:41:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:41:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:41:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:41:49,755 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:41:49,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:42:02,479 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:42:02,480 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:42:02,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:42:02,552 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:42:02,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:42:02 BoogieIcfgContainer [2024-10-13 04:42:02,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:42:02,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:42:02,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:42:02,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:42:02,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:41:49" (1/3) ... [2024-10-13 04:42:02,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60710fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:42:02, skipping insertion in model container [2024-10-13 04:42:02,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:41:49" (2/3) ... [2024-10-13 04:42:02,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60710fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:42:02, skipping insertion in model container [2024-10-13 04:42:02,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:42:02" (3/3) ... [2024-10-13 04:42:02,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-47.i [2024-10-13 04:42:02,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:42:02,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:42:02,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:42:02,636 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;@4f07b83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:42:02,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:42:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:42:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 04:42:02,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:42:02,656 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:02,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:42:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:42:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 200493385, now seen corresponding path program 1 times [2024-10-13 04:42:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:42:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826962737] [2024-10-13 04:42:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:42:02,681 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 04:42:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:42:02,684 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 04:42:02,686 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 04:42:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:42:03,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 04:42:03,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:42:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-13 04:42:06,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:42:06,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:42:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826962737] [2024-10-13 04:42:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826962737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:42:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [702479651] [2024-10-13 04:42:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:42:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:42:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:42:06,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:42:06,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-13 04:42:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:42:08,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:42:08,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:42:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:42:11,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:42:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [702479651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:42:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:42:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 04:42:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389105835] [2024-10-13 04:42:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:42:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:42:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:42:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:42:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:42:11,556 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:42:15,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:42:20,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:42:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:42:20,881 INFO L93 Difference]: Finished difference Result 277 states and 528 transitions. [2024-10-13 04:42:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:42:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-10-13 04:42:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:42:20,893 INFO L225 Difference]: With dead ends: 277 [2024-10-13 04:42:20,894 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 04:42:20,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:42:20,900 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 213 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 133 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:42:20,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 457 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2024-10-13 04:42:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 04:42:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 125. [2024-10-13 04:42:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:42:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2024-10-13 04:42:20,970 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 132 [2024-10-13 04:42:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:42:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2024-10-13 04:42:20,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:42:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-10-13 04:42:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 04:42:20,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:42:20,978 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:21,008 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 04:42:21,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:42:21,381 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 04:42:21,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:42:21,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:42:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -386312629, now seen corresponding path program 1 times [2024-10-13 04:42:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:42:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228034785] [2024-10-13 04:42:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:42:21,384 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 04:42:21,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:42:21,387 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 04:42:21,388 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 04:42:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:42:22,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 04:42:22,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:42:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:42:30,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:42:30,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:42:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228034785] [2024-10-13 04:42:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228034785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:42:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:42:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:42:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327493630] [2024-10-13 04:42:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:42:30,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:42:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:42:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:42:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:42:30,480 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:42:35,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:42:39,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []