./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:27:18,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:27:19,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:27:19,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:27:19,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:27:19,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:27:19,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:27:19,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:27:19,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:27:19,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:27:19,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:27:19,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:27:19,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:27:19,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:27:19,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:27:19,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:27:19,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:27:19,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:27:19,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:27:19,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:27:19,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:27:19,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:27:19,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:27:19,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:27:19,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:27:19,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:27:19,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:27:19,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:27:19,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:27:19,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:27:19,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:27:19,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:27:19,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:19,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:27:19,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:27:19,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:27:19,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:27:19,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:27:19,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:27:19,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:27:19,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:27:19,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:27:19,127 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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2024-11-12 01:27:19,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:27:19,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:27:19,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:27:19,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:27:19,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:27:19,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:20,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:27:21,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:27:21,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:21,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b852908b8/ab7432ea5894485d9fbd32beade062b9/FLAG76e9eadb8 [2024-11-12 01:27:21,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b852908b8/ab7432ea5894485d9fbd32beade062b9 [2024-11-12 01:27:21,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:27:21,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:27:21,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:21,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:27:21,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:27:21,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6046cc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21, skipping insertion in model container [2024-11-12 01:27:21,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:27:21,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i[917,930] [2024-11-12 01:27:21,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:21,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:27:21,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i[917,930] [2024-11-12 01:27:21,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:21,603 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:27:21,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21 WrapperNode [2024-11-12 01:27:21,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:21,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:21,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:27:21,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:27:21,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,661 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-12 01:27:21,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:21,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:27:21,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:27:21,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:27:21,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:27:21,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:27:21,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:27:21,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:27:21,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:27:21,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (1/1) ... [2024-11-12 01:27:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:21,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:27:21,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:27:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:27:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:27:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:27:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:27:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:27:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:27:21,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:27:21,954 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:27:22,480 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 01:27:22,481 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:27:22,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:27:22,502 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:27:22,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:22 BoogieIcfgContainer [2024-11-12 01:27:22,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:27:22,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:27:22,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:27:22,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:27:22,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:27:21" (1/3) ... [2024-11-12 01:27:22,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92cf18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:22, skipping insertion in model container [2024-11-12 01:27:22,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:21" (2/3) ... [2024-11-12 01:27:22,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92cf18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:22, skipping insertion in model container [2024-11-12 01:27:22,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:22" (3/3) ... [2024-11-12 01:27:22,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:22,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:27:22,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:27:22,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:27:22,613 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;@18ac8abb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:27:22,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:27:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 63 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 01:27:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 01:27:22,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:22,635 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:22,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -771967132, now seen corresponding path program 1 times [2024-11-12 01:27:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835962845] [2024-11-12 01:27:22,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:27:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:27:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:27:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:27:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:27:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:27:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:27:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:27:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:27:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:27:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:27:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:27:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:27:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:27:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:27:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:27:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:27:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 01:27:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:27:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:27:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:27:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:27:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:27:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:27:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:27:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:27:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 01:27:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:27:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 01:27:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 01:27:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:23,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835962845] [2024-11-12 01:27:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835962845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:27:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210337162] [2024-11-12 01:27:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:27:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:27:23,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:27:23,288 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 63 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 01:27:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:23,338 INFO L93 Difference]: Finished difference Result 181 states and 309 transitions. [2024-11-12 01:27:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:27:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-11-12 01:27:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:23,355 INFO L225 Difference]: With dead ends: 181 [2024-11-12 01:27:23,356 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 01:27:23,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:27:23,370 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:23,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:27:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 01:27:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-12 01:27:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 01:27:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2024-11-12 01:27:23,442 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 183 [2024-11-12 01:27:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:23,442 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2024-11-12 01:27:23,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 01:27:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-11-12 01:27:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 01:27:23,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:23,451 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:27:23,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1056717038, now seen corresponding path program 1 times [2024-11-12 01:27:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714195858] [2024-11-12 01:27:23,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:27:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:27:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:27:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:27:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:27:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:27:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:27:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:27:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:27:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:27:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:27:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:27:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:27:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:27:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:27:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:27:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:27:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 01:27:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:27:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:27:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:27:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:27:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:27:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:27:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:27:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:27:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 01:27:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:27:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 01:27:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 01:27:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714195858] [2024-11-12 01:27:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714195858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:27:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993376755] [2024-11-12 01:27:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:23,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:27:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:23,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:27:23,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:23,792 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 01:27:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:23,883 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2024-11-12 01:27:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:27:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-11-12 01:27:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:23,890 INFO L225 Difference]: With dead ends: 255 [2024-11-12 01:27:23,890 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 01:27:23,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:23,894 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 126 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:23,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 241 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:27:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 01:27:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2024-11-12 01:27:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-12 01:27:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2024-11-12 01:27:23,945 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 183 [2024-11-12 01:27:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:23,948 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2024-11-12 01:27:23,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 01:27:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2024-11-12 01:27:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 01:27:23,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:23,954 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:27:23,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 780150236, now seen corresponding path program 1 times [2024-11-12 01:27:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253561100] [2024-11-12 01:27:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:27:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092960715] [2024-11-12 01:27:24,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:27:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:24,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:27:24,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:27:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:24,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 01:27:24,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:27:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2024-11-12 01:27:25,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:27:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253561100] [2024-11-12 01:27:25,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 01:27:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092960715] [2024-11-12 01:27:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092960715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 01:27:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739423963] [2024-11-12 01:27:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:25,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:27:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:27:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:27:25,501 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 01:27:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:26,493 INFO L93 Difference]: Finished difference Result 426 states and 629 transitions. [2024-11-12 01:27:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 01:27:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-11-12 01:27:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:26,497 INFO L225 Difference]: With dead ends: 426 [2024-11-12 01:27:26,497 INFO L226 Difference]: Without dead ends: 263 [2024-11-12 01:27:26,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:27:26,500 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 255 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:26,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 580 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 01:27:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-12 01:27:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 175. [2024-11-12 01:27:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-12 01:27:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2024-11-12 01:27:26,524 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 185 [2024-11-12 01:27:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2024-11-12 01:27:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 01:27:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2024-11-12 01:27:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 01:27:26,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:26,528 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:26,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:27:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:27:26,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 193344222, now seen corresponding path program 1 times [2024-11-12 01:27:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544305411] [2024-11-12 01:27:26,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:27:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140793286] [2024-11-12 01:27:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:26,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:27:26,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:26,829 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-11-12 01:27:26,831 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-11-12 01:27:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:27:26,961 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:27:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:27:27,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:27:27,123 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:27:27,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:27:27,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 01:27:27,326 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,SelfDestructingSolverStorable3 [2024-11-12 01:27:27,330 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:27:27,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:27:27,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:27:27 BoogieIcfgContainer [2024-11-12 01:27:27,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:27:27,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:27:27,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:27:27,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:27:27,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:22" (3/4) ... [2024-11-12 01:27:27,469 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:27:27,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:27:27,471 INFO L158 Benchmark]: Toolchain (without parser) took 6215.77ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 104.0MB in the beginning and 80.5MB in the end (delta: 23.5MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,471 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:27:27,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.21ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 88.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 161.5MB. Free memory was 88.2MB in the beginning and 85.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,474 INFO L158 Benchmark]: Boogie Preprocessor took 75.84ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 82.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,474 INFO L158 Benchmark]: RCFGBuilder took 763.80ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 82.0MB in the beginning and 178.4MB in the end (delta: -96.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,474 INFO L158 Benchmark]: TraceAbstraction took 4960.16ms. Allocated memory is still 213.9MB. Free memory was 177.3MB in the beginning and 81.6MB in the end (delta: 95.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,474 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 213.9MB. Free memory was 81.6MB in the beginning and 80.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:27:27,476 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 161.5MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.21ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 88.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 161.5MB. Free memory was 88.2MB in the beginning and 85.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.84ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 82.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 763.80ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 82.0MB in the beginning and 178.4MB in the end (delta: -96.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4960.16ms. Allocated memory is still 213.9MB. Free memory was 177.3MB in the beginning and 81.6MB in the end (delta: 95.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 213.9MB. Free memory was 81.6MB in the beginning and 80.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryArithmeticFLOAToperation at line 65, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed char var_1_2 = -64; [L24] signed char var_1_3 = -1; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 10; [L31] float var_1_10 = 99.5; [L32] float var_1_11 = 5.6; [L33] float var_1_12 = 255.5; [L34] float var_1_13 = 31.25; [L35] signed short int var_1_14 = 32; [L36] unsigned long int var_1_15 = 16; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 50; [L40] unsigned char var_1_19 = 50; [L41] signed char var_1_20 = 1; [L42] signed char var_1_21 = -10; [L43] float var_1_22 = 0.5; [L44] signed char var_1_23 = 100; VAL [isInitial=0, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=-64, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L94] var_1_3 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L97] var_1_4 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L100] var_1_5 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L101] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L103] var_1_6 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L105] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L106] var_1_7 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L108] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L109] var_1_8 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L110] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L114] var_1_12 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L116] var_1_13 = __VERIFIER_nondet_float() [L117] 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, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L117] 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, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L118] var_1_15 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L119] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L120] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L120] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L122] var_1_17 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L125] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L125] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L128] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L129] var_1_19 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L131] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L131] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L132] var_1_21 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_1 = var_1_2 * var_1_3; [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L50] COND FALSE !(stepLocal_1 == var_1_4) VAL [isInitial=1, stepLocal_0=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L55] signed long int stepLocal_3 = (((var_1_6) < (0)) ? (var_1_6) : (0)); [L56] unsigned char stepLocal_2 = var_1_3 != var_1_4; VAL [isInitial=1, stepLocal_0=1, stepLocal_2=0, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L57] COND FALSE !((var_1_1 || (var_1_6 <= var_1_2)) || stepLocal_2) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L62] unsigned char stepLocal_5 = var_1_11 < var_1_12; [L63] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_4=1, stepLocal_5=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L64] COND TRUE (! var_1_1) || stepLocal_4 [L65] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L73] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] EXPR (var_1_9 / var_1_15) & var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] COND FALSE !(((var_1_9 / var_1_15) & var_1_6) >= var_1_4) [L79] var_1_14 = -128 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L82] EXPR 256u << var_1_2 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L82] unsigned long int stepLocal_6 = 256u << var_1_2; [L83] COND TRUE (((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= stepLocal_6 [L84] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L86] var_1_20 = var_1_21 [L87] var_1_22 = var_1_12 [L88] var_1_23 = var_1_21 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L139] EXPR ((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L139-L140] return (((((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=127, var_1_4=127, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 389 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 90 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 548 ConstructedInterpolants, 1 QuantifiedInterpolants, 1894 SizeOfPredicates, 2 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4872/4872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:27:27,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:27:29,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:27:29,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:27:29,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:27:29,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:27:29,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:27:29,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:27:29,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:27:29,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:27:29,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:27:29,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:27:29,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:27:29,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:27:29,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:27:29,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:27:29,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:27:29,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:27:29,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:27:29,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:27:29,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:27:29,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:27:29,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:27:29,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:27:29,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:27:29,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:27:29,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:27:29,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:27:29,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:27:29,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:27:29,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:27:29,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:27:29,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:27:29,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:27:29,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:27:29,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:29,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:27:29,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:27:29,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:27:29,907 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:27:29,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:27:29,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:27:29,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:27:29,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:27:29,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:27:29,909 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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2024-11-12 01:27:30,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:27:30,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:27:30,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:27:30,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:27:30,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:27:30,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:31,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:27:32,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:27:32,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:32,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36f901e4/f1a4c2e79ade4c5f996c8b828024d280/FLAGf0b587ca3 [2024-11-12 01:27:32,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36f901e4/f1a4c2e79ade4c5f996c8b828024d280 [2024-11-12 01:27:32,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:27:32,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:27:32,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:32,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:27:32,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:27:32,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e72ad6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32, skipping insertion in model container [2024-11-12 01:27:32,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:27:32,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i[917,930] [2024-11-12 01:27:32,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:32,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:27:32,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i[917,930] [2024-11-12 01:27:32,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:32,566 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:27:32,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32 WrapperNode [2024-11-12 01:27:32,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:32,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:32,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:27:32,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:27:32,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,622 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-12 01:27:32,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:32,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:27:32,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:27:32,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:27:32,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:27:32,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:27:32,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:27:32,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:27:32,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:27:32,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (1/1) ... [2024-11-12 01:27:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:32,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:27:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:27:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:27:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:27:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:27:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:27:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:27:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:27:32,840 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:27:32,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:27:33,498 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 01:27:33,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:27:33,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:27:33,516 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:27:33,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:33 BoogieIcfgContainer [2024-11-12 01:27:33,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:27:33,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:27:33,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:27:33,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:27:33,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:27:32" (1/3) ... [2024-11-12 01:27:33,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366460c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:33, skipping insertion in model container [2024-11-12 01:27:33,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:32" (2/3) ... [2024-11-12 01:27:33,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366460c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:33, skipping insertion in model container [2024-11-12 01:27:33,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:33" (3/3) ... [2024-11-12 01:27:33,529 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2024-11-12 01:27:33,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:27:33,548 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:27:33,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:27:33,614 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;@4de38d2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:27:33,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:27:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 01:27:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-12 01:27:33,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:33,640 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:33,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1904425205, now seen corresponding path program 1 times [2024-11-12 01:27:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:27:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439432043] [2024-11-12 01:27:33,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:33,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:27:33,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:27:33,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:27:33,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:27:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:34,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:27:34,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:27:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 01:27:34,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:27:34,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:27:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439432043] [2024-11-12 01:27:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439432043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:34,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:34,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:27:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152867284] [2024-11-12 01:27:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:34,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:27:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:27:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:27:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:34,623 INFO L87 Difference]: Start difference. First operand has 76 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 01:27:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:34,937 INFO L93 Difference]: Finished difference Result 212 states and 390 transitions. [2024-11-12 01:27:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:27:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2024-11-12 01:27:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:34,958 INFO L225 Difference]: With dead ends: 212 [2024-11-12 01:27:34,958 INFO L226 Difference]: Without dead ends: 139 [2024-11-12 01:27:34,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:34,970 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:34,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 200 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:27:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-12 01:27:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2024-11-12 01:27:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 76 states have internal predecessors, (92), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-12 01:27:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2024-11-12 01:27:35,028 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 208 transitions. Word has length 178 [2024-11-12 01:27:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:35,029 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 208 transitions. [2024-11-12 01:27:35,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 01:27:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 208 transitions. [2024-11-12 01:27:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-12 01:27:35,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:35,033 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:35,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:27:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:27:35,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 612175320, now seen corresponding path program 1 times [2024-11-12 01:27:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:27:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015462431] [2024-11-12 01:27:35,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:27:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:27:35,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:27:35,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:27:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 01:27:35,508 INFO L279 TraceCheckSpWp]: Computing forward predicates...