./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-ps-co_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 23fe6fd4a96aa17342fe9b8230b990ac35c1caedabe1c0288c33fd604c0ea3f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:25:37,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:25:37,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:25:37,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:25:37,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:25:37,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:25:37,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:25:37,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:25:37,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:25:37,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:25:37,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:25:37,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:25:37,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:25:37,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:25:37,482 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:25:37,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:25:37,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:25:37,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:25:37,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:25:37,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:25:37,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:25:37,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:25:37,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:25:37,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:25:37,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:25:37,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:25:37,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:25:37,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:25:37,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:25:37,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:25:37,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:25:37,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:25:37,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:25:37,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:25:37,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:25:37,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:25:37,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:25:37,491 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-clean/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-clean/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 -> 23fe6fd4a96aa17342fe9b8230b990ac35c1caedabe1c0288c33fd604c0ea3f6 [2024-10-11 10:25:37,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:25:37,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:25:37,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:25:37,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:25:37,691 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:25:37,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:38,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:25:39,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:25:39,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:39,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cd44ded0/3567913025fd49a1883fe82616c9662c/FLAG0564bdd80 [2024-10-11 10:25:39,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cd44ded0/3567913025fd49a1883fe82616c9662c [2024-10-11 10:25:39,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:25:39,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:25:39,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:25:39,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:25:39,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:25:39,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a7cafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39, skipping insertion in model container [2024-10-11 10:25:39,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:25:39,598 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i[919,932] [2024-10-11 10:25:39,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:25:39,666 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:25:39,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i[919,932] [2024-10-11 10:25:39,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:25:39,733 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:25:39,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39 WrapperNode [2024-10-11 10:25:39,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:25:39,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:25:39,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:25:39,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:25:39,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,781 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-11 10:25:39,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:25:39,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:25:39,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:25:39,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:25:39,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:25:39,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:25:39,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:25:39,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:25:39,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:25:39,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (1/1) ... [2024-10-11 10:25:39,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:25:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:25:39,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:25:39,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:25:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:25:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:25:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:25:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:25:39,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:25:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:25:40,036 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:25:40,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:25:40,397 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 10:25:40,398 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:25:40,427 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:25:40,429 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:25:40,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:40 BoogieIcfgContainer [2024-10-11 10:25:40,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:25:40,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:25:40,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:25:40,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:25:40,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:25:39" (1/3) ... [2024-10-11 10:25:40,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a76c22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:40, skipping insertion in model container [2024-10-11 10:25:40,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:39" (2/3) ... [2024-10-11 10:25:40,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a76c22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:40, skipping insertion in model container [2024-10-11 10:25:40,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:40" (3/3) ... [2024-10-11 10:25:40,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:40,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:25:40,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:25:40,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:25:40,498 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;@17455da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:25:40,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:25:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:25:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 10:25:40,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:40,519 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:40,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:40,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1227435735, now seen corresponding path program 1 times [2024-10-11 10:25:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457341416] [2024-10-11 10:25:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:25:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:25:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:25:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:25:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:25:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:25:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:25:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:25:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:25:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:25:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:25:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:25:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:25:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:25:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:25:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:25:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:25:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:25:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:25:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:25:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:25:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:25:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:25:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:25:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 10:25:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:25:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 10:25:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:25:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 10:25:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 10:25:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:25:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 10:25:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 10:25:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 10:25:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 10:25:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 10:25:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 10:25:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 10:25:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 10:25:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 10:25:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457341416] [2024-10-11 10:25:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457341416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:25:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020177746] [2024-10-11 10:25:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:25:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:25:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:25:41,065 INFO L87 Difference]: Start difference. First operand has 120 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:25:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:41,109 INFO L93 Difference]: Finished difference Result 237 states and 428 transitions. [2024-10-11 10:25:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:25:41,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 249 [2024-10-11 10:25:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:41,120 INFO L225 Difference]: With dead ends: 237 [2024-10-11 10:25:41,121 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 10:25:41,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:25:41,126 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:41,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:25:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 10:25:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 10:25:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:25:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 188 transitions. [2024-10-11 10:25:41,224 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 188 transitions. Word has length 249 [2024-10-11 10:25:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 188 transitions. [2024-10-11 10:25:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:25:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 188 transitions. [2024-10-11 10:25:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 10:25:41,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:41,231 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:25:41,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1701050733, now seen corresponding path program 1 times [2024-10-11 10:25:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211887793] [2024-10-11 10:25:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:25:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:25:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:25:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:25:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:25:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:25:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:25:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:25:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:25:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:25:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:25:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:25:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:25:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:25:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:25:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:25:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:25:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:25:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:25:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:25:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:25:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:25:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:25:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:25:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 10:25:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:25:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 10:25:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:25:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 10:25:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 10:25:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:25:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 10:25:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 10:25:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 10:25:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 10:25:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 10:25:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 10:25:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 10:25:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 10:25:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 10:25:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211887793] [2024-10-11 10:25:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211887793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:25:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157067259] [2024-10-11 10:25:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:41,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:25:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:25:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:25:41,544 INFO L87 Difference]: Start difference. First operand 118 states and 188 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:41,585 INFO L93 Difference]: Finished difference Result 235 states and 375 transitions. [2024-10-11 10:25:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:25:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-10-11 10:25:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:41,591 INFO L225 Difference]: With dead ends: 235 [2024-10-11 10:25:41,592 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 10:25:41,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-10-11 10:25:41,596 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:41,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:25:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 10:25:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 10:25:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:25:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2024-10-11 10:25:41,614 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 249 [2024-10-11 10:25:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:41,615 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2024-10-11 10:25:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2024-10-11 10:25:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 10:25:41,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:41,621 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:25:41,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash 599771857, now seen corresponding path program 1 times [2024-10-11 10:25:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:41,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982230764] [2024-10-11 10:25:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:25:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:25:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:25:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:25:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:25:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:25:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:25:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:25:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:25:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:25:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:25:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:25:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:25:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:25:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:25:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:25:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:25:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:25:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:25:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:25:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:25:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:25:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:25:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:25:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 10:25:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:25:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 10:25:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:25:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 10:25:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 10:25:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:25:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 10:25:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 10:25:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 10:25:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 10:25:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 10:25:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 10:25:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 10:25:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 10:25:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 10:25:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:42,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982230764] [2024-10-11 10:25:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982230764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:42,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:25:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930897885] [2024-10-11 10:25:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:42,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:25:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:42,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:25:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:25:42,086 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:42,154 INFO L93 Difference]: Finished difference Result 350 states and 555 transitions. [2024-10-11 10:25:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:25:42,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-10-11 10:25:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:42,159 INFO L225 Difference]: With dead ends: 350 [2024-10-11 10:25:42,161 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 10:25:42,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-10-11 10:25:42,162 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 113 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:42,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 374 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:25:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 10:25:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-10-11 10:25:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 147 states have (on average 1.380952380952381) internal successors, (203), 147 states have internal predecessors, (203), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 10:25:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 363 transitions. [2024-10-11 10:25:42,200 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 363 transitions. Word has length 249 [2024-10-11 10:25:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:42,200 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 363 transitions. [2024-10-11 10:25:42,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 363 transitions. [2024-10-11 10:25:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 10:25:42,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:42,204 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:42,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:25:42,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -77327983, now seen corresponding path program 1 times [2024-10-11 10:25:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104090134] [2024-10-11 10:25:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:25:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:25:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:25:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:25:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:25:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:25:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:25:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:25:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:25:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:25:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:25:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:25:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:25:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:25:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:25:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:25:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:25:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:25:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:25:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:25:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:25:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:25:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:25:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:25:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 10:25:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:25:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 10:25:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:25:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 10:25:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 10:25:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:25:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 10:25:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 10:25:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 10:25:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 10:25:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 10:25:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 10:25:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 10:25:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 10:25:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 10:25:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:42,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104090134] [2024-10-11 10:25:42,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104090134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:42,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:42,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:25:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284076197] [2024-10-11 10:25:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:42,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:25:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:25:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:25:42,625 INFO L87 Difference]: Start difference. First operand 230 states and 363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:42,923 INFO L93 Difference]: Finished difference Result 686 states and 1083 transitions. [2024-10-11 10:25:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:25:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-10-11 10:25:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:42,927 INFO L225 Difference]: With dead ends: 686 [2024-10-11 10:25:42,927 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 10:25:42,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:25:42,932 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 294 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:42,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 394 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:25:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 10:25:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 277. [2024-10-11 10:25:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 194 states have (on average 1.407216494845361) internal successors, (273), 194 states have internal predecessors, (273), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 10:25:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 433 transitions. [2024-10-11 10:25:43,005 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 433 transitions. Word has length 249 [2024-10-11 10:25:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 433 transitions. [2024-10-11 10:25:43,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 433 transitions. [2024-10-11 10:25:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 10:25:43,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:43,012 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:25:43,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1098396337, now seen corresponding path program 1 times [2024-10-11 10:25:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493014350] [2024-10-11 10:25:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:25:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:25:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:25:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:25:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:25:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:25:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:25:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:25:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:25:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:25:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:25:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:25:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:25:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:25:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:25:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:25:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:25:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:25:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:25:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:25:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:25:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:25:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:25:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:25:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 10:25:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:25:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 10:25:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:25:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 10:25:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 10:25:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:25:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 10:25:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 10:25:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 10:25:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 10:25:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 10:25:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 10:25:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 10:25:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 10:25:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 10:25:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493014350] [2024-10-11 10:25:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493014350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:25:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795639597] [2024-10-11 10:25:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:43,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:25:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:25:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:25:43,274 INFO L87 Difference]: Start difference. First operand 277 states and 433 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:43,486 INFO L93 Difference]: Finished difference Result 733 states and 1145 transitions. [2024-10-11 10:25:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:25:43,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-10-11 10:25:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:43,491 INFO L225 Difference]: With dead ends: 733 [2024-10-11 10:25:43,492 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 10:25:43,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:25:43,494 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 172 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:43,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 477 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:25:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 10:25:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 277. [2024-10-11 10:25:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 194 states have (on average 1.3969072164948453) internal successors, (271), 194 states have internal predecessors, (271), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 10:25:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 431 transitions. [2024-10-11 10:25:43,552 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 431 transitions. Word has length 249 [2024-10-11 10:25:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 431 transitions. [2024-10-11 10:25:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 431 transitions. [2024-10-11 10:25:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 10:25:43,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:43,555 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:43,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:25:43,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -76681937, now seen corresponding path program 1 times [2024-10-11 10:25:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692444740] [2024-10-11 10:25:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:25:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576144823] [2024-10-11 10:25:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:43,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:25:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:25:43,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:25:43,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:25:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:43,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:25:43,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:25:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:44,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:25:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:25:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692444740] [2024-10-11 10:25:44,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 10:25:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576144823] [2024-10-11 10:25:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576144823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:25:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358282] [2024-10-11 10:25:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:25:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:25:44,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:25:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:25:44,505 INFO L87 Difference]: Start difference. First operand 277 states and 431 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:44,772 INFO L93 Difference]: Finished difference Result 640 states and 997 transitions. [2024-10-11 10:25:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:25:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2024-10-11 10:25:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:44,775 INFO L225 Difference]: With dead ends: 640 [2024-10-11 10:25:44,775 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 10:25:44,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:25:44,777 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:44,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 404 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:25:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 10:25:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 353. [2024-10-11 10:25:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 229 states have (on average 1.3668122270742358) internal successors, (313), 229 states have internal predecessors, (313), 120 states have call successors, (120), 3 states have call predecessors, (120), 3 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:25:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 553 transitions. [2024-10-11 10:25:44,870 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 553 transitions. Word has length 251 [2024-10-11 10:25:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:44,871 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 553 transitions. [2024-10-11 10:25:44,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 553 transitions. [2024-10-11 10:25:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 10:25:44,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:44,874 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:44,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:25:45,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:25:45,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1882120271, now seen corresponding path program 1 times [2024-10-11 10:25:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:25:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274522149] [2024-10-11 10:25:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:25:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:25:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11408398] [2024-10-11 10:25:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:25:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:25:45,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:25:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:25:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:25:45,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:25:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:25:45,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:25:45,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:25:45,516 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:25:45,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:25:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:25:45,721 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:45,838 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:25:45,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:25:45 BoogieIcfgContainer [2024-10-11 10:25:45,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:25:45,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:25:45,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:25:45,841 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:25:45,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:40" (3/4) ... [2024-10-11 10:25:45,843 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:25:45,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:25:45,844 INFO L158 Benchmark]: Toolchain (without parser) took 6408.04ms. Allocated memory was 159.4MB in the beginning and 283.1MB in the end (delta: 123.7MB). Free memory was 89.3MB in the beginning and 111.9MB in the end (delta: -22.6MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,844 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 110.5MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:25:45,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 72.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.07ms. Allocated memory is still 159.4MB. Free memory was 72.2MB in the beginning and 68.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,845 INFO L158 Benchmark]: Boogie Preprocessor took 51.64ms. Allocated memory is still 159.4MB. Free memory was 68.6MB in the beginning and 64.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,845 INFO L158 Benchmark]: RCFGBuilder took 594.83ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 64.4MB in the beginning and 176.5MB in the end (delta: -112.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,845 INFO L158 Benchmark]: TraceAbstraction took 5409.36ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 176.5MB in the beginning and 111.9MB in the end (delta: 64.6MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2024-10-11 10:25:45,846 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 283.1MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:25:45,846 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.17ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 110.5MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 72.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.07ms. Allocated memory is still 159.4MB. Free memory was 72.2MB in the beginning and 68.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.64ms. Allocated memory is still 159.4MB. Free memory was 68.6MB in the beginning and 64.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 594.83ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 64.4MB in the beginning and 176.5MB in the end (delta: -112.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5409.36ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 176.5MB in the beginning and 111.9MB in the end (delta: 64.6MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 283.1MB. Free memory is still 111.9MB. 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 someBinaryFLOATComparisonOperation at line 217, overapproximation of someBinaryDOUBLEComparisonOperation at line 217, overapproximation of someUnaryDOUBLEoperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_25 = 2; [L42] unsigned long int var_1_26 = 1; [L43] signed long int var_1_27 = 25; [L44] unsigned long int var_1_29 = 32; [L45] unsigned long int var_1_30 = 1; [L46] unsigned long int var_1_31 = 8; [L47] unsigned long int var_1_32 = 500; [L48] double var_1_33 = 1.5; [L49] double var_1_35 = 50.5; [L50] double var_1_36 = 1.9; [L51] unsigned long int var_1_37 = 10000; [L52] unsigned char var_1_38 = 1; [L53] unsigned char var_1_39 = 0; [L54] double var_1_40 = 15.5; [L55] double var_1_41 = 0.21999999999999997; [L56] unsigned long int var_1_42 = 128; [L57] signed char var_1_43 = -1; [L58] signed char var_1_44 = 32; [L59] signed long int last_1_var_1_9 = -50; [L221] isInitial = 1 [L222] FCALL initially() [L223] COND TRUE 1 [L224] CALL updateLastVariables() [L214] last_1_var_1_9 = var_1_9 [L224] RET updateLastVariables() [L225] CALL updateVariables() [L151] var_1_5 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L154] var_1_6 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L157] var_1_8 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] var_1_14 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] var_1_15 = __VERIFIER_nondet_ulong() [L163] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] var_1_16 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] var_1_17 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] var_1_18 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] var_1_20 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] var_1_23 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L180] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L180] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L181] var_1_25 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L182] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L183] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L183] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=25, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L184] var_1_27 = __VERIFIER_nondet_long() [L185] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L185] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L186] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L186] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L187] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L187] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=32, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L188] var_1_29 = __VERIFIER_nondet_ulong() [L189] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L189] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L190] CALL assume_abort_if_not(var_1_29 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L190] RET assume_abort_if_not(var_1_29 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=1, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L191] var_1_30 = __VERIFIER_nondet_ulong() [L192] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L192] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=8, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L194] var_1_31 = __VERIFIER_nondet_ulong() [L195] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L195] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L196] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L196] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=500, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L197] var_1_32 = __VERIFIER_nondet_ulong() [L198] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L198] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L199] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L199] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L200] var_1_35 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L201] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L202] var_1_36 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L203] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L204] var_1_39 = __VERIFIER_nondet_uchar() [L205] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L205] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L206] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L206] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_41=21999999999999997/100000000000000000, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L207] var_1_41 = __VERIFIER_nondet_double() [L208] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L208] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L209] var_1_44 = __VERIFIER_nondet_char() [L210] CALL assume_abort_if_not(var_1_44 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L210] RET assume_abort_if_not(var_1_44 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L211] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L211] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L225] RET updateVariables() [L226] CALL step() [L63] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L64] COND FALSE !(var_1_25 != var_1_4) [L71] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L76] COND FALSE !(var_1_35 >= var_1_7) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L81] COND FALSE !(var_1_30 < ((var_1_21 + 16u) * var_1_4)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L90] COND TRUE (var_1_35 <= 64.5) && var_1_13 [L91] var_1_40 = ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L95] COND FALSE !(var_1_30 < var_1_21) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L98] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L101] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L102] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L105] var_1_21 = var_1_6 [L106] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L107] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L110] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L111] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L114] signed long int stepLocal_3 = var_1_9; [L115] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L116] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L116] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L117] COND FALSE !(var_1_9 <= stepLocal_2) [L126] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L128] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L135] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L137] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=1, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L138] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L139] COND TRUE \read(var_1_13) [L140] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L226] RET step() [L227] CALL, EXPR property() [L217] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L217] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L217] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L217-L218] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L227] RET, EXPR property() [L227] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=7, var_1_23=7, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=-1, var_1_29=0, var_1_30=66, var_1_31=0, var_1_32=0, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_41=0, var_1_42=128, var_1_43=-1, var_1_44=-127, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 2197 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 968 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1229 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 374 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 3568 SizeOfPredicates, 1 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18720/18720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:25:45,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 23fe6fd4a96aa17342fe9b8230b990ac35c1caedabe1c0288c33fd604c0ea3f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:25:47,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:25:47,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:25:47,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:25:47,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:25:47,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:25:47,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:25:47,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:25:47,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:25:47,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:25:47,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:25:47,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:25:47,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:25:47,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:25:47,719 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:25:47,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:25:47,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:25:47,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:25:47,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:25:47,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:25:47,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:25:47,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:25:47,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:25:47,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:25:47,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:25:47,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:25:47,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:25:47,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:25:47,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:25:47,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:25:47,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:25:47,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:25:47,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:25:47,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:25:47,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:25:47,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:25:47,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:25:47,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:25:47,729 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:25:47,729 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:25:47,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:25:47,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:25:47,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:25:47,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:25:47,730 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:25:47,730 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-clean/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-clean/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 -> 23fe6fd4a96aa17342fe9b8230b990ac35c1caedabe1c0288c33fd604c0ea3f6 [2024-10-11 10:25:48,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:25:48,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:25:48,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:25:48,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:25:48,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:25:48,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:49,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:25:49,510 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:25:49,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:49,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/190840e4d/18081eb7e2d241f192da544bfa67a86d/FLAG66bf8778c [2024-10-11 10:25:49,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/190840e4d/18081eb7e2d241f192da544bfa67a86d [2024-10-11 10:25:49,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:25:49,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:25:49,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:25:49,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:25:49,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:25:49,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4e5e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49, skipping insertion in model container [2024-10-11 10:25:49,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:25:49,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i[919,932] [2024-10-11 10:25:49,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:25:49,807 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:25:49,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i[919,932] [2024-10-11 10:25:49,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:25:49,868 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:25:49,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49 WrapperNode [2024-10-11 10:25:49,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:25:49,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:25:49,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:25:49,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:25:49,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,911 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2024-10-11 10:25:49,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:25:49,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:25:49,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:25:49,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:25:49,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:25:49,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:25:49,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:25:49,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:25:49,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:25:49,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (1/1) ... [2024-10-11 10:25:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:25:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:25:50,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:25:50,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:25:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:25:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:25:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:25:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:25:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:25:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:25:50,117 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:25:50,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:25:50,761 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 10:25:50,761 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:25:50,801 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:25:50,801 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:25:50,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:50 BoogieIcfgContainer [2024-10-11 10:25:50,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:25:50,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:25:50,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:25:50,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:25:50,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:25:49" (1/3) ... [2024-10-11 10:25:50,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f889b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:50, skipping insertion in model container [2024-10-11 10:25:50,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:25:49" (2/3) ... [2024-10-11 10:25:50,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f889b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:25:50, skipping insertion in model container [2024-10-11 10:25:50,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:25:50" (3/3) ... [2024-10-11 10:25:50,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-61.i [2024-10-11 10:25:50,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:25:50,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:25:50,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:25:50,886 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;@7c5cbabc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:25:50,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:25:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:25:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:25:50,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:50,905 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:50,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:50,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash -264815960, now seen corresponding path program 1 times [2024-10-11 10:25:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:25:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701474099] [2024-10-11 10:25:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:50,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:25:50,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:25:50,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:25:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:25:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:51,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:25:51,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:25:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1310 proven. 0 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-10-11 10:25:51,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:25:51,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:25:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701474099] [2024-10-11 10:25:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701474099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:25:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171223996] [2024-10-11 10:25:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:25:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:25:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:25:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:25:51,392 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:25:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:51,496 INFO L93 Difference]: Finished difference Result 201 states and 372 transitions. [2024-10-11 10:25:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:25:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 245 [2024-10-11 10:25:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:51,511 INFO L225 Difference]: With dead ends: 201 [2024-10-11 10:25:51,512 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 10:25:51,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:25:51,517 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:25:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 10:25:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 10:25:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:25:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2024-10-11 10:25:51,567 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 245 [2024-10-11 10:25:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2024-10-11 10:25:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:25:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2024-10-11 10:25:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:25:51,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:51,575 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:51,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:25:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:25:51,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:51,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2057088924, now seen corresponding path program 1 times [2024-10-11 10:25:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:25:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497363007] [2024-10-11 10:25:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:25:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:25:51,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:25:51,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:25:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:52,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:25:52,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:25:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:25:52,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:25:52,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:25:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497363007] [2024-10-11 10:25:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497363007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:25:52,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:25:52,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:25:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393736116] [2024-10-11 10:25:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:25:52,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:25:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:25:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:25:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:25:52,505 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:25:52,844 INFO L93 Difference]: Finished difference Result 296 states and 480 transitions. [2024-10-11 10:25:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:25:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:25:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:25:52,852 INFO L225 Difference]: With dead ends: 296 [2024-10-11 10:25:52,852 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 10:25:52,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 243 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-10-11 10:25:52,854 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 41 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:25:52,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 308 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:25:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 10:25:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-10-11 10:25:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 10:25:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 313 transitions. [2024-10-11 10:25:52,880 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 313 transitions. Word has length 245 [2024-10-11 10:25:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:25:52,880 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 313 transitions. [2024-10-11 10:25:52,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:25:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 313 transitions. [2024-10-11 10:25:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:25:52,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:25:52,883 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:25:52,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:25:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:25:53,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:25:53,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:25:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1639511844, now seen corresponding path program 1 times [2024-10-11 10:25:53,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:25:53,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257508595] [2024-10-11 10:25:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:25:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:25:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:25:53,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:25:53,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:25:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:25:53,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:25:53,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:25:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2024-10-11 10:25:54,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:25:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:25:57,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:25:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257508595] [2024-10-11 10:25:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257508595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:25:57,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:25:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-10-11 10:25:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141537853] [2024-10-11 10:25:57,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:25:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 10:25:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:25:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 10:25:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:25:57,430 INFO L87 Difference]: Start difference. First operand 194 states and 313 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-11 10:26:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:00,789 INFO L93 Difference]: Finished difference Result 640 states and 1022 transitions. [2024-10-11 10:26:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 10:26:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 245 [2024-10-11 10:26:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:00,800 INFO L225 Difference]: With dead ends: 640 [2024-10-11 10:26:00,800 INFO L226 Difference]: Without dead ends: 447 [2024-10-11 10:26:00,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:26:00,802 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 297 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:00,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 462 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 10:26:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-11 10:26:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 280. [2024-10-11 10:26:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 155 states have internal predecessors, (209), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:26:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 449 transitions. [2024-10-11 10:26:00,858 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 449 transitions. Word has length 245 [2024-10-11 10:26:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:00,860 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 449 transitions. [2024-10-11 10:26:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-11 10:26:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 449 transitions. [2024-10-11 10:26:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:26:00,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:00,864 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:00,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:26:01,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:01,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 51163942, now seen corresponding path program 1 times [2024-10-11 10:26:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136462782] [2024-10-11 10:26:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:01,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:01,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:01,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:01,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:26:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:01,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:26:01,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:26:01,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:01,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:01,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136462782] [2024-10-11 10:26:01,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136462782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:01,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:01,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:26:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495995793] [2024-10-11 10:26:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:01,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:26:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:26:01,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:26:01,651 INFO L87 Difference]: Start difference. First operand 280 states and 449 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:26:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:02,262 INFO L93 Difference]: Finished difference Result 715 states and 1152 transitions. [2024-10-11 10:26:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:26:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:26:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:02,275 INFO L225 Difference]: With dead ends: 715 [2024-10-11 10:26:02,276 INFO L226 Difference]: Without dead ends: 512 [2024-10-11 10:26:02,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 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-10-11 10:26:02,277 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 126 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:02,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 576 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:26:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-11 10:26:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 481. [2024-10-11 10:26:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 274 states have (on average 1.3686131386861313) internal successors, (375), 274 states have internal predecessors, (375), 200 states have call successors, (200), 6 states have call predecessors, (200), 6 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-10-11 10:26:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 775 transitions. [2024-10-11 10:26:02,337 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 775 transitions. Word has length 245 [2024-10-11 10:26:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 775 transitions. [2024-10-11 10:26:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:26:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 775 transitions. [2024-10-11 10:26:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:26:02,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:02,341 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:02,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:26:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:02,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -959953308, now seen corresponding path program 1 times [2024-10-11 10:26:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882563228] [2024-10-11 10:26:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:02,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:02,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 10:26:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:02,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:26:02,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:26:03,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:03,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882563228] [2024-10-11 10:26:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882563228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999104621] [2024-10-11 10:26:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:03,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:26:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:26:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:03,077 INFO L87 Difference]: Start difference. First operand 481 states and 775 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:26:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:03,446 INFO L93 Difference]: Finished difference Result 483 states and 776 transitions. [2024-10-11 10:26:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:26:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:26:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:03,449 INFO L225 Difference]: With dead ends: 483 [2024-10-11 10:26:03,449 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 10:26:03,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:03,450 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 42 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:03,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 214 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:26:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 10:26:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-10-11 10:26:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 155 states have (on average 1.3225806451612903) internal successors, (205), 155 states have internal predecessors, (205), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:26:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 445 transitions. [2024-10-11 10:26:03,481 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 445 transitions. Word has length 245 [2024-10-11 10:26:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:03,482 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 445 transitions. [2024-10-11 10:26:03,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:26:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 445 transitions. [2024-10-11 10:26:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:26:03,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:03,486 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:03,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Ended with exit code 0 [2024-10-11 10:26:03,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:03,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1352980318, now seen corresponding path program 1 times [2024-10-11 10:26:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977117231] [2024-10-11 10:26:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:03,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:03,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 10:26:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:03,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 10:26:03,919 INFO L278 TraceCheckSpWp]: Computing forward predicates...