./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:24:38,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:24:38,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:24:38,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:24:38,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:24:38,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:24:38,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:24:38,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:24:38,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:24:38,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:24:38,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:24:38,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:24:38,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:24:38,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:24:38,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:24:38,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:24:38,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:24:38,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:24:38,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:24:38,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:24:38,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:24:38,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:24:38,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:24:38,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:24:38,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:24:38,551 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:24:38,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:24:38,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:24:38,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:24:38,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:24:38,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:24:38,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:24:38,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:24:38,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:24:38,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:24:38,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:24:38,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:24:38,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:24:38,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:24:38,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:24:38,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:24:38,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:24:38,563 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-11-16 12:24:38,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:24:38,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:24:38,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:24:38,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:24:38,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:24:38,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:40,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:24:40,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:24:40,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:40,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a901aa1/7ed9b6308ac441da9560ee529dcfd66b/FLAG28362a673 [2024-11-16 12:24:40,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a901aa1/7ed9b6308ac441da9560ee529dcfd66b [2024-11-16 12:24:40,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:24:40,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:24:40,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:24:40,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:24:40,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:24:40,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:40" (1/1) ... [2024-11-16 12:24:40,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1b6796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:40, skipping insertion in model container [2024-11-16 12:24:40,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:40" (1/1) ... [2024-11-16 12:24:40,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:24:41,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-11-16 12:24:41,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:24:41,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:24:41,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-11-16 12:24:41,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:24:41,324 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:24:41,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41 WrapperNode [2024-11-16 12:24:41,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:24:41,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:24:41,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:24:41,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:24:41,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,392 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-16 12:24:41,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:24:41,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:24:41,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:24:41,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:24:41,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,443 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:24:41,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:24:41,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:24:41,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:24:41,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:24:41,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (1/1) ... [2024-11-16 12:24:41,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:24:41,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:24:41,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:24:41,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:24:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:24:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:24:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:24:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:24:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:24:41,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:24:41,746 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:24:41,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:24:42,118 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1; [2024-11-16 12:24:42,168 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 12:24:42,169 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:24:42,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:24:42,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:24:42,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:24:42 BoogieIcfgContainer [2024-11-16 12:24:42,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:24:42,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:24:42,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:24:42,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:24:42,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:40" (1/3) ... [2024-11-16 12:24:42,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776de839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:42, skipping insertion in model container [2024-11-16 12:24:42,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:41" (2/3) ... [2024-11-16 12:24:42,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776de839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:42, skipping insertion in model container [2024-11-16 12:24:42,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:24:42" (3/3) ... [2024-11-16 12:24:42,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:42,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:24:42,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:24:42,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:24:42,305 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;@6e0afd01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:24:42,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:24:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 57 states have internal predecessors, (72), 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-11-16 12:24:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 12:24:42,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:42,337 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, 1, 1, 1, 1] [2024-11-16 12:24:42,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1233084668, now seen corresponding path program 1 times [2024-11-16 12:24:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982711425] [2024-11-16 12:24:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:24:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:24:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:24:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:24:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:24:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:24:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:24:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:24:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:24:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:24:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:24:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:24:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:24:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:24:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:24:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:24:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:24:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:24:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:24:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:24:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:24:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:24:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:24:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:24:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:24:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:24:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 12:24:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:24:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 12:24:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 12:24:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:24:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:24:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 12:24:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:24:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982711425] [2024-11-16 12:24:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982711425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:24:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872003260] [2024-11-16 12:24:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:24:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:24:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:24:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:24:43,047 INFO L87 Difference]: Start difference. First operand has 91 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 57 states have internal predecessors, (72), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-11-16 12:24:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:43,094 INFO L93 Difference]: Finished difference Result 174 states and 297 transitions. [2024-11-16 12:24:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:24:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 200 [2024-11-16 12:24:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:43,111 INFO L225 Difference]: With dead ends: 174 [2024-11-16 12:24:43,112 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 12:24:43,119 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-11-16 12:24:43,125 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:43,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:24:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 12:24:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 12:24:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 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-11-16 12:24:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2024-11-16 12:24:43,198 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 200 [2024-11-16 12:24:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2024-11-16 12:24:43,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-11-16 12:24:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2024-11-16 12:24:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 12:24:43,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:43,208 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, 1, 1, 1, 1] [2024-11-16 12:24:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:24:43,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1309580552, now seen corresponding path program 1 times [2024-11-16 12:24:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68076846] [2024-11-16 12:24:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:24:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:24:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:24:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:24:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:24:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:24:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:24:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:24:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:24:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:24:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:24:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:24:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:24:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:24:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:24:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:24:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:24:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:24:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:24:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:24:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:24:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:24:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:24:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:24:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:24:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:24:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 12:24:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:24:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 12:24:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 12:24:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:24:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:24:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 12:24:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:24:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68076846] [2024-11-16 12:24:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68076846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:24:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611866243] [2024-11-16 12:24:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:46,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:24:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:24:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:24:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:24:46,078 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-11-16 12:24:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:46,558 INFO L93 Difference]: Finished difference Result 230 states and 334 transitions. [2024-11-16 12:24:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:24:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 200 [2024-11-16 12:24:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:46,562 INFO L225 Difference]: With dead ends: 230 [2024-11-16 12:24:46,563 INFO L226 Difference]: Without dead ends: 147 [2024-11-16 12:24:46,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:24:46,565 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 70 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:46,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 712 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:24:46,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-16 12:24:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2024-11-16 12:24:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 92 states have internal predecessors, (120), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:24:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-11-16 12:24:46,601 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 200 [2024-11-16 12:24:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:46,603 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-11-16 12:24:46,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-11-16 12:24:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-11-16 12:24:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 12:24:46,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:46,611 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, 1, 1, 1, 1] [2024-11-16 12:24:46,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:24:46,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:46,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1815139177, now seen corresponding path program 1 times [2024-11-16 12:24:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:46,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859425805] [2024-11-16 12:24:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:24:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:24:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:24:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:24:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:24:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:24:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:24:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:24:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:24:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:24:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:24:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:24:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:24:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:24:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:24:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:24:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:24:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:24:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:24:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:24:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:24:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:24:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:24:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:24:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:24:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:24:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 12:24:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:24:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 12:24:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 12:24:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:24:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:24:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 12:24:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:24:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859425805] [2024-11-16 12:24:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859425805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:24:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825566415] [2024-11-16 12:24:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:24:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:24:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:24:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:24:48,257 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-11-16 12:24:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:48,746 INFO L93 Difference]: Finished difference Result 271 states and 392 transitions. [2024-11-16 12:24:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:24:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 200 [2024-11-16 12:24:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:48,753 INFO L225 Difference]: With dead ends: 271 [2024-11-16 12:24:48,755 INFO L226 Difference]: Without dead ends: 146 [2024-11-16 12:24:48,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:24:48,759 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 61 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 818 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:24:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-16 12:24:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2024-11-16 12:24:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:24:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-16 12:24:48,778 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 200 [2024-11-16 12:24:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:48,779 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-16 12:24:48,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-11-16 12:24:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-16 12:24:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 12:24:48,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:48,783 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, 1, 1, 1, 1] [2024-11-16 12:24:48,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:24:48,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:48,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1820114729, now seen corresponding path program 1 times [2024-11-16 12:24:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683980249] [2024-11-16 12:24:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:24:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:24:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:24:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:24:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:24:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:24:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:24:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:24:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:24:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:24:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:24:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:24:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:24:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:24:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:24:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:24:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:24:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:24:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:24:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:24:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:24:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:24:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:24:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:24:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:24:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:24:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 12:24:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:24:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 12:24:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 12:24:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:24:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:24:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 12:24:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:24:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683980249] [2024-11-16 12:24:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683980249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:24:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198817408] [2024-11-16 12:24:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:24:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:24:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:24:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:24:49,001 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11-16 12:24:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:49,061 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2024-11-16 12:24:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:24:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 200 [2024-11-16 12:24:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:49,063 INFO L225 Difference]: With dead ends: 237 [2024-11-16 12:24:49,063 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 12:24:49,064 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-11-16 12:24:49,065 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 36 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:49,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 554 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:24:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 12:24:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2024-11-16 12:24:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:24:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-16 12:24:49,089 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 200 [2024-11-16 12:24:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:49,090 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-16 12:24:49,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11-16 12:24:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-16 12:24:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 12:24:49,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:49,094 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, 1, 1, 1, 1] [2024-11-16 12:24:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:24:49,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1969293942, now seen corresponding path program 1 times [2024-11-16 12:24:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354211266] [2024-11-16 12:24:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:24:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:24:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:24:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:24:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:24:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:24:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:24:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:24:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:24:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:24:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:24:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:24:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:24:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:24:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:24:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:24:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:24:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:24:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:24:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:24:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:24:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:24:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:24:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:24:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:24:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:24:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 12:24:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:24:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 12:24:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 12:24:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:24:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:24:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 12:24:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:24:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354211266] [2024-11-16 12:24:50,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354211266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:50,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:50,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:24:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589666351] [2024-11-16 12:24:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:24:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:24:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:24:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:24:50,094 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-11-16 12:24:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:50,405 INFO L93 Difference]: Finished difference Result 237 states and 340 transitions. [2024-11-16 12:24:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:24:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 200 [2024-11-16 12:24:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:50,407 INFO L225 Difference]: With dead ends: 237 [2024-11-16 12:24:50,407 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 12:24:50,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:24:50,409 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 27 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:50,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 834 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:24:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 12:24:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2024-11-16 12:24:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:24:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2024-11-16 12:24:50,422 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 200 [2024-11-16 12:24:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:50,423 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2024-11-16 12:24:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-11-16 12:24:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2024-11-16 12:24:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-16 12:24:50,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:50,426 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, 1, 1, 1, 1, 1, 1] [2024-11-16 12:24:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:24:50,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:50,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 212481151, now seen corresponding path program 1 times [2024-11-16 12:24:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:24:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550626135] [2024-11-16 12:24:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:24:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:24:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740203576] [2024-11-16 12:24:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:24:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:24:50,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:24:50,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:24:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:24:50,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:24:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:24:50,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:24:50,974 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:24:50,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:24:50,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:24:51,180 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-11-16 12:24:51,184 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 12:24:51,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:24:51,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:24:51 BoogieIcfgContainer [2024-11-16 12:24:51,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:24:51,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:24:51,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:24:51,319 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:24:51,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:24:42" (3/4) ... [2024-11-16 12:24:51,322 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:24:51,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:24:51,324 INFO L158 Benchmark]: Toolchain (without parser) took 10455.95ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 110.0MB in the beginning and 144.4MB in the end (delta: -34.4MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,324 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:24:51,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.07ms. Allocated memory is still 182.5MB. Free memory was 109.7MB in the beginning and 93.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 182.5MB. Free memory was 93.0MB in the beginning and 88.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,325 INFO L158 Benchmark]: Boogie Preprocessor took 90.19ms. Allocated memory is still 182.5MB. Free memory was 88.2MB in the beginning and 81.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,326 INFO L158 Benchmark]: IcfgBuilder took 714.77ms. Allocated memory is still 182.5MB. Free memory was 81.8MB in the beginning and 125.6MB in the end (delta: -43.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,326 INFO L158 Benchmark]: TraceAbstraction took 9116.60ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 124.5MB in the beginning and 144.4MB in the end (delta: -19.9MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-11-16 12:24:51,326 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 343.9MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:24:51,330 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.12ms. Allocated memory is still 182.5MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.07ms. Allocated memory is still 182.5MB. Free memory was 109.7MB in the beginning and 93.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 182.5MB. Free memory was 93.0MB in the beginning and 88.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.19ms. Allocated memory is still 182.5MB. Free memory was 88.2MB in the beginning and 81.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 714.77ms. Allocated memory is still 182.5MB. Free memory was 81.8MB in the beginning and 125.6MB in the end (delta: -43.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9116.60ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 124.5MB in the beginning and 144.4MB in the end (delta: -19.9MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 343.9MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 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; VAL [isInitial=0, 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=-500, 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] [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=32800, 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=32800, 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=32800, 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=32800, 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=32800, 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=32800, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L107] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L108] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L108] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=229363, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L111] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L111] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L116] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L117] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L117] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L123] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L123] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L126] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L126] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, stepLocal_0=-1000000, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=8, var_1_9=-65503] [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=32800, var_1_10=229363, var_1_11=65568, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [L61] signed long int stepLocal_2 = var_1_15; VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=229363, var_1_11=65568, var_1_12=13, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [L71] COND FALSE !(((((((((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)) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [L74] signed long int stepLocal_3 = var_1_5 - var_1_20; VAL [isInitial=1, stepLocal_2=-2147483648, stepLocal_3=0, var_1_10=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, 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=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [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=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] [L19] reach_error() VAL [isInitial=1, var_1_10=229363, var_1_11=65568, var_1_12=13, var_1_13=12, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=46, var_1_2=32800, var_1_3=13, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=13, var_1_8=32800, var_1_9=-65503] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 3044 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2369 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 759 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 675 mSDtfsCounter, 759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred 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, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1404 NumberOfCodeBlocks, 1404 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 4063 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-11-16 12:24:51,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:24:53,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:24:53,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:24:53,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:24:53,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:24:53,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:24:53,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:24:53,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:24:53,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:24:53,787 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:24:53,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:24:53,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:24:53,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:24:53,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:24:53,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:24:53,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:24:53,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:24:53,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:24:53,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:24:53,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:24:53,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:24:53,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:24:53,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:24:53,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:24:53,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:24:53,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:24:53,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:24:53,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:24:53,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:24:53,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:24:53,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:24:53,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:24:53,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:24:53,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:24:53,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:24:53,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:24:53,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:24:53,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:24:53,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:24:53,798 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:24:53,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:24:53,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:24:53,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:24:53,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:24:53,799 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-11-16 12:24:54,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:24:54,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:24:54,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:24:54,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:24:54,156 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:24:54,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:55,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:24:55,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:24:55,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:55,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f08f4baaf/28c0935b59db4724bf9db7e4e3f279db/FLAGee90a3102 [2024-11-16 12:24:56,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f08f4baaf/28c0935b59db4724bf9db7e4e3f279db [2024-11-16 12:24:56,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:24:56,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:24:56,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:24:56,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:24:56,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:24:56,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56186cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56, skipping insertion in model container [2024-11-16 12:24:56,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:24:56,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-11-16 12:24:56,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:24:56,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:24:56,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i[917,930] [2024-11-16 12:24:56,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:24:56,460 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:24:56,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56 WrapperNode [2024-11-16 12:24:56,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:24:56,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:24:56,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:24:56,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:24:56,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,527 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-16 12:24:56,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:24:56,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:24:56,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:24:56,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:24:56,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:24:56,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:24:56,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:24:56,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:24:56,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:24:56,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (1/1) ... [2024-11-16 12:24:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:24:56,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:24:56,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:24:56,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:24:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:24:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:24:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:24:56,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:24:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:24:56,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:24:56,795 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:24:56,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:24:58,458 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 12:24:58,460 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:24:58,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:24:58,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:24:58,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:24:58 BoogieIcfgContainer [2024-11-16 12:24:58,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:24:58,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:24:58,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:24:58,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:24:58,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:56" (1/3) ... [2024-11-16 12:24:58,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d387fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:58, skipping insertion in model container [2024-11-16 12:24:58,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:56" (2/3) ... [2024-11-16 12:24:58,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d387fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:58, skipping insertion in model container [2024-11-16 12:24:58,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:24:58" (3/3) ... [2024-11-16 12:24:58,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-11-16 12:24:58,509 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:24:58,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:24:58,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:24:58,587 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;@6734a898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:24:58,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:24:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.2553191489361701) 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-11-16 12:24:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 12:24:58,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:58,615 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, 1, 1] [2024-11-16 12:24:58,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:58,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1939483465, now seen corresponding path program 1 times [2024-11-16 12:24:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:24:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742731956] [2024-11-16 12:24:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:24:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:24:58,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:24:58,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:24:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:24:58,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:24:59,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:24:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2024-11-16 12:24:59,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:24:59,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:24:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742731956] [2024-11-16 12:24:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742731956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:24:59,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:24:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:24:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333050920] [2024-11-16 12:24:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:24:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:24:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:24:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:24:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:24:59,133 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.2553191489361701) 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) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-16 12:24:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:24:59,177 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2024-11-16 12:24:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:24:59,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 198 [2024-11-16 12:24:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:24:59,189 INFO L225 Difference]: With dead ends: 156 [2024-11-16 12:24:59,190 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 12:24:59,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:24:59,199 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:24:59,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:24:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 12:24:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 12:24:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-11-16 12:24:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-16 12:24:59,262 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 198 [2024-11-16 12:24:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:24:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-16 12:24:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-16 12:24:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-16 12:24:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 12:24:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:24:59,267 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, 1, 1] [2024-11-16 12:24:59,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:24:59,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:24:59,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:24:59,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:24:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1017349051, now seen corresponding path program 1 times [2024-11-16 12:24:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:24:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60955828] [2024-11-16 12:24:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:24:59,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:24:59,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:24:59,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:24:59,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:25:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:25:02,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-16 12:25:02,776 INFO L278 TraceCheckSpWp]: Computing forward predicates...