./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:54:26,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:54:26,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:54:26,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:54:26,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:54:26,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:54:26,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:54:26,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:54:26,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:54:26,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:54:26,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:54:26,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:54:26,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:54:26,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:54:26,417 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:54:26,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:54:26,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:54:26,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:54:26,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:54:26,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:54:26,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:54:26,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:54:26,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:54:26,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:54:26,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:54:26,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:54:26,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:54:26,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:54:26,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:54:26,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:54:26,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:54:26,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:54:26,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:54:26,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:54:26,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:54:26,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:54:26,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:54:26,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:54:26,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:54:26,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:54:26,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:54:26,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:54:26,428 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-11-20 04:54:26,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:54:26,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:54:26,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:54:26,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:54:26,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:54:26,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:28,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:54:28,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:54:28,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:28,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67249dccb/fc40992131fb486c814db1d570ea5a31/FLAG98fa223d0 [2024-11-20 04:54:28,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67249dccb/fc40992131fb486c814db1d570ea5a31 [2024-11-20 04:54:28,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:54:28,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:54:28,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:54:28,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:54:28,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:54:28,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e033dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28, skipping insertion in model container [2024-11-20 04:54:28,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:54:28,640 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_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-20 04:54:28,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:54:28,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:54:28,729 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_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-20 04:54:28,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:54:28,803 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:54:28,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28 WrapperNode [2024-11-20 04:54:28,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:54:28,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:54:28,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:54:28,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:54:28,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,861 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-20 04:54:28,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:54:28,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:54:28,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:54:28,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:54:28,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,894 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-20 04:54:28,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:54:28,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:54:28,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:54:28,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:54:28,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (1/1) ... [2024-11-20 04:54:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:54:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:54:28,981 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-20 04:54:28,988 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-20 04:54:29,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:54:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:54:29,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:54:29,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:54:29,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:54:29,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:54:29,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:54:29,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:54:29,700 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:54:29,700 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:54:29,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:54:29,720 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:54:29,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:29 BoogieIcfgContainer [2024-11-20 04:54:29,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:54:29,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:54:29,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:54:29,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:54:29,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:54:28" (1/3) ... [2024-11-20 04:54:29,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ff3e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:29, skipping insertion in model container [2024-11-20 04:54:29,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:28" (2/3) ... [2024-11-20 04:54:29,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ff3e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:29, skipping insertion in model container [2024-11-20 04:54:29,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:29" (3/3) ... [2024-11-20 04:54:29,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:29,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:54:29,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:54:29,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:54:29,818 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;@e8f9ccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:54:29,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:54:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 04:54:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 04:54:29,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:29,841 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:29,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 980803782, now seen corresponding path program 1 times [2024-11-20 04:54:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:29,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162184164] [2024-11-20 04:54:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:54:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:54:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:54:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:54:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:54:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:54:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:54:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:54:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:54:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:54:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:54:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:54:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:54:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:54:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:54:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:54:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:54:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:54:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:54:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:54:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:54:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:54:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:54:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:54:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:54:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:54:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 04:54:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:54:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162184164] [2024-11-20 04:54:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162184164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:30,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:54:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668076745] [2024-11-20 04:54:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:30,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:54:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:54:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:54:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:54:30,400 INFO L87 Difference]: Start difference. First operand has 104 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 04:54:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:30,434 INFO L93 Difference]: Finished difference Result 201 states and 346 transitions. [2024-11-20 04:54:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:54:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-20 04:54:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:30,445 INFO L225 Difference]: With dead ends: 201 [2024-11-20 04:54:30,445 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 04:54:30,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-20 04:54:30,452 INFO L432 NwaCegarLoop]: 156 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, 156 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-20 04:54:30,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:54:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 04:54:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-20 04:54:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 04:54:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-20 04:54:30,510 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 174 [2024-11-20 04:54:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:30,511 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-20 04:54:30,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 04:54:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-20 04:54:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 04:54:30,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:30,515 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:30,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:54:30,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:30,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1748651918, now seen corresponding path program 1 times [2024-11-20 04:54:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235319702] [2024-11-20 04:54:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:54:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:54:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:54:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:54:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:54:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:54:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:54:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:54:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:54:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:54:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:54:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:54:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:54:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:54:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:54:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:54:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:54:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:54:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:54:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:54:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:54:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:54:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:54:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:54:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:54:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:54:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 04:54:31,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:54:31,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235319702] [2024-11-20 04:54:31,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235319702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:31,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:31,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:54:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950235951] [2024-11-20 04:54:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:54:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:54:31,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:54:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:54:31,359 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:31,505 INFO L93 Difference]: Finished difference Result 253 states and 397 transitions. [2024-11-20 04:54:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:54:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-20 04:54:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:31,511 INFO L225 Difference]: With dead ends: 253 [2024-11-20 04:54:31,513 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 04:54:31,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:54:31,515 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 38 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:31,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 258 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:54:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 04:54:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-20 04:54:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:54:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 237 transitions. [2024-11-20 04:54:31,569 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 237 transitions. Word has length 174 [2024-11-20 04:54:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:31,570 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 237 transitions. [2024-11-20 04:54:31,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 237 transitions. [2024-11-20 04:54:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 04:54:31,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:31,576 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:54:31,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:31,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -455660467, now seen corresponding path program 1 times [2024-11-20 04:54:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546474924] [2024-11-20 04:54:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:54:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:54:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:54:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:54:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:54:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:54:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:54:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:54:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:54:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:54:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:54:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:54:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:54:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:54:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:54:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:54:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:54:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:54:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:54:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:54:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:54:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:54:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:54:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:54:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:54:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:54:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 04:54:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:54:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546474924] [2024-11-20 04:54:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546474924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:54:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561720671] [2024-11-20 04:54:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:54:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:54:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:54:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:54:31,768 INFO L87 Difference]: Start difference. First operand 152 states and 237 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:31,865 INFO L93 Difference]: Finished difference Result 250 states and 392 transitions. [2024-11-20 04:54:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:54:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-20 04:54:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:31,869 INFO L225 Difference]: With dead ends: 250 [2024-11-20 04:54:31,871 INFO L226 Difference]: Without dead ends: 153 [2024-11-20 04:54:31,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:54:31,873 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:31,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:54:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-20 04:54:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-20 04:54:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:54:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2024-11-20 04:54:31,900 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 175 [2024-11-20 04:54:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:31,901 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2024-11-20 04:54:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2024-11-20 04:54:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 04:54:31,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:31,907 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:54:31,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1221375017, now seen corresponding path program 1 times [2024-11-20 04:54:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325294637] [2024-11-20 04:54:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:54:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:54:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:54:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:54:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:54:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:54:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:54:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:54:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:54:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:54:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:54:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:54:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:54:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:54:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:54:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:54:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:54:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:54:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:54:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:54:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:54:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:54:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:54:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:54:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:54:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:54:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 04:54:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:54:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325294637] [2024-11-20 04:54:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325294637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:34,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:34,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 04:54:34,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5415332] [2024-11-20 04:54:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:34,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 04:54:34,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:54:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 04:54:34,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:54:34,693 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:36,500 INFO L93 Difference]: Finished difference Result 460 states and 710 transitions. [2024-11-20 04:54:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 04:54:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-20 04:54:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:36,507 INFO L225 Difference]: With dead ends: 460 [2024-11-20 04:54:36,507 INFO L226 Difference]: Without dead ends: 362 [2024-11-20 04:54:36,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 04:54:36,510 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 595 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:36,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 920 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 04:54:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-20 04:54:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 312. [2024-11-20 04:54:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 226 states have internal predecessors, (320), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-20 04:54:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 484 transitions. [2024-11-20 04:54:36,580 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 484 transitions. Word has length 175 [2024-11-20 04:54:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:36,581 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 484 transitions. [2024-11-20 04:54:36,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 484 transitions. [2024-11-20 04:54:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 04:54:36,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:36,585 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:54:36,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:36,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 200306663, now seen corresponding path program 1 times [2024-11-20 04:54:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544844299] [2024-11-20 04:54:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:54:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:54:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:54:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:54:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:54:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:54:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:54:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:54:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:54:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:54:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:54:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:54:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:54:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:54:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:54:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:54:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:54:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:54:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:54:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:54:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:54:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:54:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:54:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:54:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:54:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:54:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 04:54:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:54:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544844299] [2024-11-20 04:54:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544844299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:54:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922996855] [2024-11-20 04:54:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:37,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:54:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:54:37,176 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-20 04:54:37,177 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-20 04:54:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:37,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 04:54:37,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:54:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 04:54:37,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:54:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 04:54:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922996855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:54:38,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:54:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-11-20 04:54:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647866059] [2024-11-20 04:54:38,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:54:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 04:54:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:54:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 04:54:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-20 04:54:38,416 INFO L87 Difference]: Start difference. First operand 312 states and 484 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-11-20 04:54:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:39,784 INFO L93 Difference]: Finished difference Result 997 states and 1526 transitions. [2024-11-20 04:54:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 04:54:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) Word has length 175 [2024-11-20 04:54:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:39,791 INFO L225 Difference]: With dead ends: 997 [2024-11-20 04:54:39,791 INFO L226 Difference]: Without dead ends: 737 [2024-11-20 04:54:39,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 04:54:39,794 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 847 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:39,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1277 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 04:54:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-20 04:54:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 482. [2024-11-20 04:54:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 335 states have (on average 1.3044776119402985) internal successors, (437), 338 states have internal predecessors, (437), 134 states have call successors, (134), 12 states have call predecessors, (134), 12 states have return successors, (134), 131 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-20 04:54:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 705 transitions. [2024-11-20 04:54:39,849 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 705 transitions. Word has length 175 [2024-11-20 04:54:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:39,850 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 705 transitions. [2024-11-20 04:54:39,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-11-20 04:54:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 705 transitions. [2024-11-20 04:54:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 04:54:39,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:39,852 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:39,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:54:40,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:54:40,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:40,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 568257959, now seen corresponding path program 1 times [2024-11-20 04:54:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:54:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383134724] [2024-11-20 04:54:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:54:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:54:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168196639] [2024-11-20 04:54:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:54:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:54:40,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:54:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:54:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:54:40,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:54:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:54:40,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:54:40,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:54:40,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:54:40,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:54:40,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 04:54:40,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 04:54:40,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:54:40,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:54:40 BoogieIcfgContainer [2024-11-20 04:54:40,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:54:40,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:54:40,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:54:40,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:54:40,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:29" (3/4) ... [2024-11-20 04:54:40,838 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:54:40,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:54:40,840 INFO L158 Benchmark]: Toolchain (without parser) took 12419.82ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 136.3MB in the beginning and 269.4MB in the end (delta: -133.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,840 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:54:40,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.70ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 118.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.24ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,841 INFO L158 Benchmark]: Boogie Preprocessor took 79.00ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 108.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,841 INFO L158 Benchmark]: RCFGBuilder took 778.62ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 111.3MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,842 INFO L158 Benchmark]: TraceAbstraction took 11110.92ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 110.3MB in the beginning and 270.5MB in the end (delta: -160.2MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2024-11-20 04:54:40,842 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 314.6MB. Free memory was 270.5MB in the beginning and 269.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:54:40,843 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.70ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 118.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.24ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.00ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 108.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 778.62ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 111.3MB in the end (delta: -3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11110.92ms. Allocated memory was 167.8MB in the beginning and 314.6MB in the end (delta: 146.8MB). Free memory was 110.3MB in the beginning and 270.5MB in the end (delta: -160.2MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 314.6MB. Free memory was 270.5MB in the beginning and 269.4MB in the end (delta: 1.0MB). 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 187, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] float var_1_21 = 4.2; [L41] float var_1_22 = 5.5; [L42] signed short int var_1_23 = -10; [L43] unsigned long int var_1_30 = 1000000000; [L44] unsigned long int var_1_31 = 4155847319; [L45] float var_1_33 = 99.25; [L46] signed long int var_1_34 = 10; [L47] unsigned char var_1_35 = 16; [L48] unsigned char var_1_36 = 100; [L49] signed long int var_1_39 = -128; [L50] signed long int var_1_40 = 1792665454; [L51] unsigned char last_1_var_1_8 = 1; [L52] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] var_1_10 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] var_1_15 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L172] var_1_31 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_31 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L173] RET assume_abort_if_not(var_1_31 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L175] var_1_36 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L177] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L178] var_1_40 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L180] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L195] RET updateVariables() [L196] CALL step() [L56] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L58] COND TRUE \read(last_1_var_1_8) [L59] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE var_1_5 < var_1_3 [L65] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L69] COND TRUE \read(var_1_8) [L70] var_1_34 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] COND FALSE !(var_1_1 > (var_1_1 >> var_1_5)) [L79] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L81] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L82] COND FALSE !(128u <= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L97] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L102] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L105] COND TRUE var_1_31 > var_1_1 [L106] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L114] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L115] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L116] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L120] var_1_20 = ((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) [L121] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_4 == stepLocal_1 [L123] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L125] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L127] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L187-L188] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1491 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1480 mSDsluCounter, 2881 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2084 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2365 IncrementalHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 797 mSDtfsCounter, 2365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 641 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 309 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 4269 SizeOfPredicates, 5 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8965/9100 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-20 04:54:40,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:54:42,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:54:43,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:54:43,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:54:43,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:54:43,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:54:43,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:54:43,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:54:43,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:54:43,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:54:43,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:54:43,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:54:43,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:54:43,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:54:43,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:54:43,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:54:43,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:54:43,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:54:43,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:54:43,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:54:43,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:54:43,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:54:43,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:54:43,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:54:43,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:54:43,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:54:43,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:54:43,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:54:43,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:54:43,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:54:43,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:54:43,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:54:43,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:54:43,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:54:43,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:54:43,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:54:43,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:54:43,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:54:43,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:54:43,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:54:43,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:54:43,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:54:43,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:54:43,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:54:43,153 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-11-20 04:54:43,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:54:43,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:54:43,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:54:43,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:54:43,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:54:43,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:45,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:54:45,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:54:45,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:45,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c32888e/5409369bad014bd7b113dd9dc44547c4/FLAG12b6ffbb0 [2024-11-20 04:54:45,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c32888e/5409369bad014bd7b113dd9dc44547c4 [2024-11-20 04:54:45,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:54:45,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:54:45,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:54:45,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:54:45,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:54:45,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f935776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45, skipping insertion in model container [2024-11-20 04:54:45,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:54:45,584 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_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-20 04:54:45,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:54:45,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:54:45,700 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_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-20 04:54:45,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:54:45,772 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:54:45,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45 WrapperNode [2024-11-20 04:54:45,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:54:45,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:54:45,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:54:45,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:54:45,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,832 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-20 04:54:45,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:54:45,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:54:45,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:54:45,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:54:45,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,864 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-20 04:54:45,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:54:45,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:54:45,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:54:45,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:54:45,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (1/1) ... [2024-11-20 04:54:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:54:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:54:45,956 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-20 04:54:45,963 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-20 04:54:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:54:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:54:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:54:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:54:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:54:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:54:46,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:54:46,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:54:47,083 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 04:54:47,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:54:47,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:54:47,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:54:47,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:47 BoogieIcfgContainer [2024-11-20 04:54:47,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:54:47,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:54:47,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:54:47,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:54:47,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:54:45" (1/3) ... [2024-11-20 04:54:47,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feaf3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:47, skipping insertion in model container [2024-11-20 04:54:47,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:45" (2/3) ... [2024-11-20 04:54:47,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feaf3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:47, skipping insertion in model container [2024-11-20 04:54:47,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:47" (3/3) ... [2024-11-20 04:54:47,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-20 04:54:47,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:54:47,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:54:47,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:54:47,212 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;@3fd45d2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:54:47,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:54:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 04:54:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 04:54:47,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:47,238 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:47,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2003112969, now seen corresponding path program 1 times [2024-11-20 04:54:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:54:47,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345084688] [2024-11-20 04:54:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:47,263 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-20 04:54:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:54:47,268 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-20 04:54:47,269 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-20 04:54:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:47,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:54:47,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:54:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-20 04:54:47,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:54:47,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:54:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345084688] [2024-11-20 04:54:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345084688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:54:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079093831] [2024-11-20 04:54:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:54:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:54:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:54:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:54:47,712 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 04:54:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:47,741 INFO L93 Difference]: Finished difference Result 163 states and 288 transitions. [2024-11-20 04:54:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:54:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-20 04:54:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:47,751 INFO L225 Difference]: With dead ends: 163 [2024-11-20 04:54:47,752 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 04:54:47,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-20 04:54:47,761 INFO L432 NwaCegarLoop]: 127 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, 127 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-20 04:54:47,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:54:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 04:54:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 04:54:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 04:54:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-11-20 04:54:47,815 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 169 [2024-11-20 04:54:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:47,816 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-11-20 04:54:47,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 04:54:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-11-20 04:54:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 04:54:47,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:47,819 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:47,827 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-20 04:54:48,020 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-20 04:54:48,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:48,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1737596881, now seen corresponding path program 1 times [2024-11-20 04:54:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:54:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962315948] [2024-11-20 04:54:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:48,023 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-20 04:54:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:54:48,026 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-20 04:54:48,028 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-20 04:54:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:48,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 04:54:48,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:54:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 04:54:48,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:54:48,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:54:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962315948] [2024-11-20 04:54:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962315948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:54:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:54:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:54:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641639587] [2024-11-20 04:54:48,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:54:48,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:54:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:54:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:54:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:54:48,720 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:49,284 INFO L93 Difference]: Finished difference Result 238 states and 376 transitions. [2024-11-20 04:54:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:54:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-20 04:54:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:49,295 INFO L225 Difference]: With dead ends: 238 [2024-11-20 04:54:49,295 INFO L226 Difference]: Without dead ends: 160 [2024-11-20 04:54:49,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:54:49,297 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:49,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 414 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 04:54:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-20 04:54:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2024-11-20 04:54:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:54:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2024-11-20 04:54:49,335 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 169 [2024-11-20 04:54:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:49,338 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2024-11-20 04:54:49,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 04:54:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2024-11-20 04:54:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 04:54:49,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:49,343 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:49,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:54:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:54:49,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 137762340, now seen corresponding path program 1 times [2024-11-20 04:54:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:54:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901339840] [2024-11-20 04:54:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:49,546 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-20 04:54:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:54:49,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:54:49,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:54:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:49,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:54:49,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:54:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 04:54:50,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:54:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 04:54:50,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:54:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901339840] [2024-11-20 04:54:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901339840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:54:50,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:54:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-20 04:54:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580846532] [2024-11-20 04:54:50,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:54:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 04:54:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:54:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 04:54:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 04:54:50,989 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-20 04:54:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:54:53,798 INFO L93 Difference]: Finished difference Result 628 states and 981 transitions. [2024-11-20 04:54:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 04:54:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 170 [2024-11-20 04:54:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:54:53,805 INFO L225 Difference]: With dead ends: 628 [2024-11-20 04:54:53,807 INFO L226 Difference]: Without dead ends: 550 [2024-11-20 04:54:53,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2024-11-20 04:54:53,813 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1144 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:54:53,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 611 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 04:54:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-20 04:54:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 377. [2024-11-20 04:54:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 255 states have (on average 1.4039215686274509) internal successors, (358), 257 states have internal predecessors, (358), 114 states have call successors, (114), 7 states have call predecessors, (114), 7 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-20 04:54:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 586 transitions. [2024-11-20 04:54:53,912 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 586 transitions. Word has length 170 [2024-11-20 04:54:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:54:53,913 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 586 transitions. [2024-11-20 04:54:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-20 04:54:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 586 transitions. [2024-11-20 04:54:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 04:54:53,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:54:53,918 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:54:53,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:54:54,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-20 04:54:54,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:54:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:54:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1726110242, now seen corresponding path program 1 times [2024-11-20 04:54:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:54:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111794293] [2024-11-20 04:54:54,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:54:54,121 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-20 04:54:54,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:54:54,124 INFO L229 MonitoredProcess]: Starting monitored process 5 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-20 04:54:54,126 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 (5)] Waiting until timeout for monitored process [2024-11-20 04:54:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:54:54,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 04:54:54,322 INFO L278 TraceCheckSpWp]: Computing forward predicates...