./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:38:29,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:38:29,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:38:29,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:38:29,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:38:29,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:38:29,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:38:29,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:38:29,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:38:29,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:38:29,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:38:29,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:38:29,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:38:29,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:38:29,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:38:29,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:38:29,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:38:29,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:38:29,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:38:29,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:38:29,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:38:29,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:38:29,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:38:29,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:38:29,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:38:29,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:38:29,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:38:29,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:38:29,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:38:29,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:38:29,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:38:29,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:38:29,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:38:29,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:38:29,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:38:29,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:38:29,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:38:29,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:38:29,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:38:29,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:38:29,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:38:29,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:38:29,916 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-14 07:38:30,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:38:30,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:38:30,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:38:30,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:38:30,217 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:38:30,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-14 07:38:31,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:38:31,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:38:31,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-14 07:38:31,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102e98e51/beee80d711494e6ab0d4030ade4d7116/FLAGa92ab45fc [2024-10-14 07:38:32,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102e98e51/beee80d711494e6ab0d4030ade4d7116 [2024-10-14 07:38:32,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:38:32,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:38:32,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:38:32,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:38:32,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:38:32,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6026d47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32, skipping insertion in model container [2024-10-14 07:38:32,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:38:32,491 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-10-14 07:38:32,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:38:32,575 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:38:32,592 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-10-14 07:38:32,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:38:32,662 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:38:32,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32 WrapperNode [2024-10-14 07:38:32,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:38:32,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:38:32,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:38:32,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:38:32,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,736 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-14 07:38:32,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:38:32,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:38:32,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:38:32,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:38:32,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:38:32,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:38:32,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:38:32,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:38:32,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:38:32,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (1/1) ... [2024-10-14 07:38:32,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:38:32,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:38:32,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:38:32,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:38:32,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:38:32,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:38:32,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:38:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:38:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:38:32,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:38:33,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:38:33,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:38:33,410 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 07:38:33,410 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:38:33,456 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:38:33,459 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:38:33,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:38:33 BoogieIcfgContainer [2024-10-14 07:38:33,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:38:33,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:38:33,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:38:33,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:38:33,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:38:32" (1/3) ... [2024-10-14 07:38:33,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e5f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:38:33, skipping insertion in model container [2024-10-14 07:38:33,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:32" (2/3) ... [2024-10-14 07:38:33,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e5f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:38:33, skipping insertion in model container [2024-10-14 07:38:33,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:38:33" (3/3) ... [2024-10-14 07:38:33,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-14 07:38:33,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:38:33,487 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:38:33,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:38:33,555 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;@6a108132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:38:33,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:38:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:38:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 07:38:33,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:33,580 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:33,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:33,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:33,587 INFO L85 PathProgramCache]: Analyzing trace with hash 950371602, now seen corresponding path program 1 times [2024-10-14 07:38:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773329181] [2024-10-14 07:38:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:38:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:38:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:38:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:38:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:38:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:38:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:38:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 07:38:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 07:38:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 07:38:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 07:38:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 07:38:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 07:38:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 07:38:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773329181] [2024-10-14 07:38:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773329181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:38:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28433470] [2024-10-14 07:38:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:34,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:38:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:38:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:38:34,314 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 07:38:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:34,366 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-10-14 07:38:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:38:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 194 [2024-10-14 07:38:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:34,378 INFO L225 Difference]: With dead ends: 161 [2024-10-14 07:38:34,378 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 07:38:34,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:38:34,390 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:34,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:38:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 07:38:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 07:38:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:38:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-14 07:38:34,453 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 194 [2024-10-14 07:38:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:34,454 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-14 07:38:34,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 07:38:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-14 07:38:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 07:38:34,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:34,459 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:34,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:38:34,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:34,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash -668326134, now seen corresponding path program 1 times [2024-10-14 07:38:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44510739] [2024-10-14 07:38:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:38:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:38:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:38:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:38:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:38:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:38:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:38:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 07:38:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 07:38:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 07:38:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 07:38:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 07:38:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 07:38:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 07:38:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44510739] [2024-10-14 07:38:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44510739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:38:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858277463] [2024-10-14 07:38:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:47,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:38:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:38:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:38:47,809 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:48,536 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2024-10-14 07:38:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:38:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-14 07:38:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:48,541 INFO L225 Difference]: With dead ends: 205 [2024-10-14 07:38:48,541 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 07:38:48,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:38:48,543 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 54 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:48,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 419 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:38:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 07:38:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2024-10-14 07:38:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:38:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-14 07:38:48,567 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-14 07:38:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-14 07:38:48,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-14 07:38:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 07:38:48,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:48,577 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:48,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:38:48,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash -410160696, now seen corresponding path program 1 times [2024-10-14 07:38:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:48,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934286419] [2024-10-14 07:38:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:38:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:38:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:38:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:38:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:38:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:38:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:38:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 07:38:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 07:38:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 07:38:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 07:38:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 07:38:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 07:38:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 07:38:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934286419] [2024-10-14 07:38:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934286419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:55,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:55,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:38:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890477119] [2024-10-14 07:38:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:55,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:38:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:38:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:38:55,382 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:55,862 INFO L93 Difference]: Finished difference Result 207 states and 314 transitions. [2024-10-14 07:38:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:38:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-14 07:38:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:55,865 INFO L225 Difference]: With dead ends: 207 [2024-10-14 07:38:55,865 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 07:38:55,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:38:55,867 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:55,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 445 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:38:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 07:38:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2024-10-14 07:38:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:38:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-14 07:38:55,878 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-14 07:38:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:55,879 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-14 07:38:55,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-14 07:38:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 07:38:55,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:55,882 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:38:55,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1679443384, now seen corresponding path program 1 times [2024-10-14 07:38:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163354337] [2024-10-14 07:38:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:38:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:38:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:38:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:38:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:38:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:38:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:38:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 07:38:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 07:38:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 07:38:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 07:38:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 07:38:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 07:38:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 07:38:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:56,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163354337] [2024-10-14 07:38:56,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163354337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:56,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:56,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:38:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399739059] [2024-10-14 07:38:56,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:38:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:38:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:38:56,056 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:56,102 INFO L93 Difference]: Finished difference Result 196 states and 296 transitions. [2024-10-14 07:38:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:38:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-14 07:38:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:56,105 INFO L225 Difference]: With dead ends: 196 [2024-10-14 07:38:56,105 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 07:38:56,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:38:56,107 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 32 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:56,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 525 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:38:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 07:38:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-10-14 07:38:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:38:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-14 07:38:56,116 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 194 [2024-10-14 07:38:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:56,117 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-14 07:38:56,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:38:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-14 07:38:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 07:38:56,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:56,119 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:38:56,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1421277946, now seen corresponding path program 1 times [2024-10-14 07:38:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:56,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768737614] [2024-10-14 07:38:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:39:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:39:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:39:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:39:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:39:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:39:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:39:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:39:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:39:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:39:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:39:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:39:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:39:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:39:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:39:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:39:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:39:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:39:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:39:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:39:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:39:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:39:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:39:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:39:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:39:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:39:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 07:39:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 07:39:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 07:39:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 07:39:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 07:39:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 07:39:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 07:39:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:39:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768737614] [2024-10-14 07:39:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768737614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:39:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:39:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:39:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505340018] [2024-10-14 07:39:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:39:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:39:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:39:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:39:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:39:01,317 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:39:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:39:01,830 INFO L93 Difference]: Finished difference Result 196 states and 294 transitions. [2024-10-14 07:39:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:39:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-14 07:39:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:39:01,832 INFO L225 Difference]: With dead ends: 196 [2024-10-14 07:39:01,832 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 07:39:01,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:39:01,834 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 54 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:39:01,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 525 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:39:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 07:39:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2024-10-14 07:39:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:39:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-10-14 07:39:01,855 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 194 [2024-10-14 07:39:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:39:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-10-14 07:39:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 07:39:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-10-14 07:39:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 07:39:01,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:39:01,860 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:39:01,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:39:01,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:39:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:39:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1400761881, now seen corresponding path program 1 times [2024-10-14 07:39:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:39:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100236027] [2024-10-14 07:39:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:39:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:39:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:39:01,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351310208] [2024-10-14 07:39:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:39:01,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:39:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:39:01,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:39:01,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:39:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:39:02,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:39:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:39:02,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:39:02,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:39:02,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:39:02,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:39:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 07:39:02,599 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 07:39:02,728 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:39:02,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:39:02 BoogieIcfgContainer [2024-10-14 07:39:02,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:39:02,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:39:02,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:39:02,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:39:02,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:38:33" (3/4) ... [2024-10-14 07:39:02,735 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:39:02,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:39:02,737 INFO L158 Benchmark]: Toolchain (without parser) took 30433.99ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 128.9MB in the beginning and 1.1GB in the end (delta: -926.9MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,737 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:39:02,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.83ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 112.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.91ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 108.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,738 INFO L158 Benchmark]: Boogie Preprocessor took 98.34ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 100.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,738 INFO L158 Benchmark]: RCFGBuilder took 623.30ms. Allocated memory is still 161.5MB. Free memory was 100.7MB in the beginning and 72.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,739 INFO L158 Benchmark]: TraceAbstraction took 29267.89ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 71.3MB in the beginning and 1.1GB in the end (delta: -985.5MB). Peak memory consumption was 621.9MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,741 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 1.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:39:02,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.83ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 112.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.91ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 108.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.34ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 100.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 623.30ms. Allocated memory is still 161.5MB. Free memory was 100.7MB in the beginning and 72.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29267.89ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 71.3MB in the beginning and 1.1GB in the end (delta: -985.5MB). Peak memory consumption was 621.9MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 1.1GB. Free memory was 1.1GB in the beginning and 1.1GB 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 someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed long int var_1_2 = -500; [L24] signed char var_1_3 = 1; [L25] signed char var_1_4 = 100; [L26] signed char var_1_5 = 5; [L27] signed char var_1_6 = 32; [L28] signed char var_1_7 = 32; [L29] unsigned short int var_1_8 = 8; [L30] unsigned short int var_1_9 = 25; [L31] unsigned short int var_1_10 = 21451; [L32] unsigned short int var_1_11 = 16; [L33] unsigned char var_1_12 = 8; [L34] unsigned short int var_1_13 = 16; [L35] unsigned char var_1_14 = 1; [L36] signed long int var_1_15 = 0; [L37] unsigned short int var_1_16 = 53444; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] double var_1_19 = 1.2; [L41] signed char var_1_20 = 1; [L42] double var_1_21 = 10.5; [L43] double var_1_22 = 0.0; [L44] double var_1_23 = 10.4; [L45] double var_1_24 = 50.5; [L46] unsigned short int var_1_25 = 2; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L92] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L94] var_1_5 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L95] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L98] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_long() [L116] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L121] var_1_18 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L124] var_1_20 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L127] var_1_21 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L128] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L129] var_1_22 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L130] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L131] var_1_23 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L132] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L133] var_1_24 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L134] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, stepLocal_0=-1000000, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L51] COND TRUE var_1_2 >= stepLocal_0 [L52] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L56] var_1_8 = (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11)) [L57] signed long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=32891, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L58] COND TRUE var_1_8 == stepLocal_1 [L59] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L61] signed long int stepLocal_2 = var_1_15; VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L62] COND FALSE !(\read(var_1_14)) [L69] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L71] COND TRUE ((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12) [L72] var_1_17 = var_1_18 VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L74] signed long int stepLocal_3 = var_1_5 - var_1_20; VAL [isInitial=1, stepLocal_2=-2147483648, stepLocal_3=0, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L75] COND TRUE var_1_1 >= stepLocal_3 [L76] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L78] COND TRUE (var_1_13 < var_1_12) || var_1_14 [L79] var_1_25 = (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139-L140] return (((((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((var_1_13 < var_1_12) || var_1_14) ? (var_1_25 == ((unsigned short int) (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 2033 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 581 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 17884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9920/9920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:39:02,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:39:05,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:39:05,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:39:05,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:39:05,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:39:05,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:39:05,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:39:05,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:39:05,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:39:05,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:39:05,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:39:05,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:39:05,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:39:05,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:39:05,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:39:05,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:39:05,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:39:05,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:39:05,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:39:05,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:39:05,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:39:05,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:39:05,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:39:05,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:39:05,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:39:05,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:39:05,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:39:05,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:39:05,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:39:05,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:39:05,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:39:05,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:39:05,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:39:05,300 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:39:05,300 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:39:05,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:39:05,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:39:05,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:39:05,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:39:05,301 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:39:05,302 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-14 07:39:05,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:39:05,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:39:05,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:39:05,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:39:05,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:39:05,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-14 07:39:07,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:39:07,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:39:07,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-14 07:39:07,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f733b906b/80cfa50706fb4f448e645d3d04b9fca6/FLAGd9b070196 [2024-10-14 07:39:07,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f733b906b/80cfa50706fb4f448e645d3d04b9fca6 [2024-10-14 07:39:07,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:39:07,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:39:07,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:39:07,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:39:07,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:39:07,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:39:07" (1/1) ... [2024-10-14 07:39:07,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c0fba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:07, skipping insertion in model container [2024-10-14 07:39:07,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:39:07" (1/1) ... [2024-10-14 07:39:07,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:39:07,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-10-14 07:39:07,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:39:07,965 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:39:07,980 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-10-14 07:39:08,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:39:08,066 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:39:08,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08 WrapperNode [2024-10-14 07:39:08,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:39:08,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:39:08,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:39:08,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:39:08,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,133 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-14 07:39:08,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:39:08,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:39:08,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:39:08,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:39:08,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:39:08,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:39:08,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:39:08,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:39:08,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:39:08,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (1/1) ... [2024-10-14 07:39:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:39:08,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:39:08,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:39:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:39:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:39:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:39:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:39:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:39:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:39:08,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:39:08,431 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:39:08,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:39:09,550 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 07:39:09,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:39:09,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:39:09,629 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:39:09,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:39:09 BoogieIcfgContainer [2024-10-14 07:39:09,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:39:09,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:39:09,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:39:09,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:39:09,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:39:07" (1/3) ... [2024-10-14 07:39:09,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dabd7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:39:09, skipping insertion in model container [2024-10-14 07:39:09,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:39:08" (2/3) ... [2024-10-14 07:39:09,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dabd7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:39:09, skipping insertion in model container [2024-10-14 07:39:09,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:39:09" (3/3) ... [2024-10-14 07:39:09,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-14 07:39:09,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:39:09,666 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:39:09,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:39:09,766 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;@1a8826bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:39:09,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:39:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:39:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 07:39:09,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:39:09,794 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:39:09,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:39:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:39:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -694731706, now seen corresponding path program 1 times [2024-10-14 07:39:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:39:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176849752] [2024-10-14 07:39:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:39:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:39:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:39:09,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:39:09,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:39:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:10,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:39:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:39:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-10-14 07:39:10,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:39:10,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:39:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176849752] [2024-10-14 07:39:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176849752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:39:10,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:39:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:39:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944473775] [2024-10-14 07:39:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:39:10,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:39:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:39:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:39:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:39:10,344 INFO L87 Difference]: Start difference. First operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 07:39:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:39:11,370 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2024-10-14 07:39:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:39:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 192 [2024-10-14 07:39:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:39:11,393 INFO L225 Difference]: With dead ends: 143 [2024-10-14 07:39:11,394 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 07:39:11,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:39:11,401 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:39:11,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 07:39:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 07:39:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 07:39:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:39:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-14 07:39:11,473 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 192 [2024-10-14 07:39:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:39:11,474 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-14 07:39:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 07:39:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-14 07:39:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 07:39:11,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:39:11,482 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:39:11,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:39:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:39:11,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:39:11,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:39:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 273415230, now seen corresponding path program 1 times [2024-10-14 07:39:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:39:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518526318] [2024-10-14 07:39:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:39:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:39:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:39:11,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:39:11,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:39:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:39:14,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-14 07:39:14,379 INFO L278 TraceCheckSpWp]: Computing forward predicates...