./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_fillercodesize_ps-cn-25_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff39960e1869a9d289df842bb5f83c21f1a0a1866b31bb4ed9efa0f1d167781c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:08:19,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:08:19,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:08:19,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:08:19,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:08:20,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:08:20,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:08:20,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:08:20,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:08:20,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:08:20,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:08:20,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:08:20,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:08:20,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:08:20,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:08:20,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:08:20,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:08:20,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:08:20,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:08:20,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:08:20,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:08:20,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:08:20,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:08:20,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:08:20,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:08:20,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:08:20,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:08:20,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:08:20,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:08:20,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:08:20,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:08:20,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:08:20,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:20,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:08:20,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:08:20,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:08:20,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:08:20,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:08:20,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:08:20,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:08:20,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:08:20,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:08:20,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff39960e1869a9d289df842bb5f83c21f1a0a1866b31bb4ed9efa0f1d167781c [2024-10-13 01:08:20,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:08:20,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:08:20,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:08:20,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:08:20,346 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:08:20,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:21,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:08:22,027 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:08:22,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:22,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6cfaeb60/f9419b45c1964820ab6b37019c15d968/FLAG567c32c2b [2024-10-13 01:08:22,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6cfaeb60/f9419b45c1964820ab6b37019c15d968 [2024-10-13 01:08:22,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:08:22,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:08:22,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:22,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:08:22,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:08:22,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4481565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22, skipping insertion in model container [2024-10-13 01:08:22,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:08:22,556 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_fillercodesize_ps-cn-25_file-6.i[914,927] [2024-10-13 01:08:22,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:22,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:08:22,632 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_fillercodesize_ps-cn-25_file-6.i[914,927] [2024-10-13 01:08:22,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:22,685 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:08:22,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22 WrapperNode [2024-10-13 01:08:22,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:22,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:22,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:08:22,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:08:22,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,734 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-13 01:08:22,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:22,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:08:22,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:08:22,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:08:22,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,778 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-13 01:08:22,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:08:22,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:08:22,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:08:22,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:08:22,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (1/1) ... [2024-10-13 01:08:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:22,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:22,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:08:22,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:08:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:08:22,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:08:22,956 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:08:22,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:08:23,326 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 01:08:23,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:08:23,389 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:08:23,389 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:08:23,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:23 BoogieIcfgContainer [2024-10-13 01:08:23,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:08:23,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:08:23,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:08:23,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:08:23,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:08:22" (1/3) ... [2024-10-13 01:08:23,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e26d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:23, skipping insertion in model container [2024-10-13 01:08:23,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:22" (2/3) ... [2024-10-13 01:08:23,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e26d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:23, skipping insertion in model container [2024-10-13 01:08:23,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:23" (3/3) ... [2024-10-13 01:08:23,399 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:23,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:08:23,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:08:23,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:08:23,492 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;@3eefabd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:08:23,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:08:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:08:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 01:08:23,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:23,517 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:23,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:23,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1927836659, now seen corresponding path program 1 times [2024-10-13 01:08:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429388197] [2024-10-13 01:08:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:08:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:08:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 01:08:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:08:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:08:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:08:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:08:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:08:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:08:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:08:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:08:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:08:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:08:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:08:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:08:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:08:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:08:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:08:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:08:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:08:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:08:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:08:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:08:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:08:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429388197] [2024-10-13 01:08:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429388197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:08:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357721261] [2024-10-13 01:08:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:23,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:08:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:08:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:08:24,018 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:08:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,066 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2024-10-13 01:08:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:08:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-13 01:08:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,078 INFO L225 Difference]: With dead ends: 155 [2024-10-13 01:08:24,079 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 01:08:24,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:08:24,085 INFO L432 NwaCegarLoop]: 117 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, 117 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-13 01:08:24,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 01:08:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 01:08:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:08:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-10-13 01:08:24,140 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 165 [2024-10-13 01:08:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-10-13 01:08:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:08:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-10-13 01:08:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 01:08:24,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:24,160 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:08:24,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1239036621, now seen corresponding path program 1 times [2024-10-13 01:08:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165132639] [2024-10-13 01:08:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:08:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:08:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 01:08:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:08:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:08:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:08:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:08:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:08:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:08:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:08:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:08:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:08:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:08:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:08:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:08:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:08:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:08:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:08:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:08:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:08:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:08:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:08:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:08:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:08:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165132639] [2024-10-13 01:08:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165132639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:24,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:08:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871345150] [2024-10-13 01:08:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:08:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:08:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,488 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,541 INFO L93 Difference]: Finished difference Result 154 states and 241 transitions. [2024-10-13 01:08:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:08:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-13 01:08:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,546 INFO L225 Difference]: With dead ends: 154 [2024-10-13 01:08:24,546 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 01:08:24,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,548 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:24,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 01:08:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 01:08:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:08:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-13 01:08:24,564 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 165 [2024-10-13 01:08:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:24,566 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-13 01:08:24,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-13 01:08:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 01:08:24,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:24,570 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:08:24,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 227919371, now seen corresponding path program 1 times [2024-10-13 01:08:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406076959] [2024-10-13 01:08:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:08:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:08:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 01:08:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:08:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:08:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:08:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:08:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:08:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:08:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:08:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:08:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:08:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:08:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:08:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:08:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:08:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:08:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:08:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:08:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:08:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:08:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:08:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:08:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:08:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:24,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406076959] [2024-10-13 01:08:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406076959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:24,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:24,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:08:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524876726] [2024-10-13 01:08:24,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:08:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:08:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,879 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:24,971 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions. [2024-10-13 01:08:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:08:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-13 01:08:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:24,975 INFO L225 Difference]: With dead ends: 211 [2024-10-13 01:08:24,978 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 01:08:24,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:08:24,980 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 83 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:24,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 282 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:08:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 01:08:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-10-13 01:08:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.353658536585366) internal successors, (111), 83 states have internal predecessors, (111), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 01:08:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 203 transitions. [2024-10-13 01:08:25,016 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 203 transitions. Word has length 165 [2024-10-13 01:08:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 203 transitions. [2024-10-13 01:08:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 203 transitions. [2024-10-13 01:08:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 01:08:25,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:25,024 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:08:25,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:25,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -30246067, now seen corresponding path program 1 times [2024-10-13 01:08:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063683763] [2024-10-13 01:08:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:08:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:08:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 01:08:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:08:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:08:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:08:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:08:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:08:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:08:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:08:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:08:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:08:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:08:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:08:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:08:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:08:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:08:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:08:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:08:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:08:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:08:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:08:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:08:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:08:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063683763] [2024-10-13 01:08:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063683763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:25,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:25,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:08:25,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235697929] [2024-10-13 01:08:25,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:25,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:08:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:08:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:08:25,420 INFO L87 Difference]: Start difference. First operand 131 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:25,633 INFO L93 Difference]: Finished difference Result 356 states and 553 transitions. [2024-10-13 01:08:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:08:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-13 01:08:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:25,640 INFO L225 Difference]: With dead ends: 356 [2024-10-13 01:08:25,643 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 01:08:25,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-13 01:08:25,645 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 96 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:25,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 347 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:08:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 01:08:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2024-10-13 01:08:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 119 states have internal predecessors, (156), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 01:08:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 300 transitions. [2024-10-13 01:08:25,697 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 300 transitions. Word has length 165 [2024-10-13 01:08:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 300 transitions. [2024-10-13 01:08:25,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:08:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 300 transitions. [2024-10-13 01:08:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:08:25,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:25,701 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:08:25,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1054272091, now seen corresponding path program 1 times [2024-10-13 01:08:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233076729] [2024-10-13 01:08:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:08:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:08:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:08:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 01:08:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:08:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 01:08:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:08:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:08:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:08:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 01:08:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:08:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:08:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:08:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:08:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:08:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 01:08:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:08:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 01:08:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:08:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 01:08:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 01:08:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:08:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 01:08:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 01:08:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 01:08:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 01:08:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 01:08:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:08:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233076729] [2024-10-13 01:08:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233076729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:08:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533907233] [2024-10-13 01:08:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:26,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:26,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:26,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:08:26,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:08:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:26,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 01:08:26,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:08:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 679 proven. 78 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-13 01:08:26,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:08:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 01:08:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533907233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:08:27,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:08:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-13 01:08:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44186705] [2024-10-13 01:08:27,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:08:27,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 01:08:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:08:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 01:08:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:08:27,024 INFO L87 Difference]: Start difference. First operand 194 states and 300 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 01:08:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:08:28,105 INFO L93 Difference]: Finished difference Result 728 states and 1069 transitions. [2024-10-13 01:08:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 01:08:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 166 [2024-10-13 01:08:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:08:28,111 INFO L225 Difference]: With dead ends: 728 [2024-10-13 01:08:28,111 INFO L226 Difference]: Without dead ends: 598 [2024-10-13 01:08:28,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 01:08:28,114 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 377 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:08:28,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 684 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 01:08:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-13 01:08:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 432. [2024-10-13 01:08:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 274 states have (on average 1.281021897810219) internal successors, (351), 278 states have internal predecessors, (351), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-13 01:08:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 631 transitions. [2024-10-13 01:08:28,189 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 631 transitions. Word has length 166 [2024-10-13 01:08:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:08:28,189 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 631 transitions. [2024-10-13 01:08:28,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 01:08:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 631 transitions. [2024-10-13 01:08:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:08:28,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:28,192 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:28,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 01:08:28,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:28,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:28,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1755336669, now seen corresponding path program 1 times [2024-10-13 01:08:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:08:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003568273] [2024-10-13 01:08:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:08:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:08:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016838257] [2024-10-13 01:08:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:08:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:28,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:08:28,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:08:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:08:28,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:08:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:08:28,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:08:28,802 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:08:28,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:08:28,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:08:29,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 01:08:29,008 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 01:08:29,123 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:08:29,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:08:29 BoogieIcfgContainer [2024-10-13 01:08:29,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:08:29,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:08:29,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:08:29,126 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:08:29,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:23" (3/4) ... [2024-10-13 01:08:29,129 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:08:29,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:08:29,130 INFO L158 Benchmark]: Toolchain (without parser) took 6778.56ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 139.8MB in the beginning and 194.8MB in the end (delta: -55.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,131 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:08:29,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 167.8MB. Free memory was 139.5MB in the beginning and 123.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.20ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,131 INFO L158 Benchmark]: Boogie Preprocessor took 63.48ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 117.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,132 INFO L158 Benchmark]: RCFGBuilder took 590.77ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 118.1MB in the end (delta: -396.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,132 INFO L158 Benchmark]: TraceAbstraction took 5734.02ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 117.9MB in the beginning and 194.8MB in the end (delta: -77.0MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2024-10-13 01:08:29,132 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 251.7MB. Free memory is still 194.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:08:29,134 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 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 167.8MB. Free memory was 139.5MB in the beginning and 123.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.20ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.48ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 117.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 590.77ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 118.1MB in the end (delta: -396.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5734.02ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 117.9MB in the beginning and 194.8MB in the end (delta: -77.0MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 251.7MB. Free memory is still 194.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryArithmeticFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] signed long int var_1_20 = -4; [L39] signed long int var_1_21 = 4; [L40] signed short int var_1_22 = -4; [L41] signed short int var_1_23 = -5; [L42] float var_1_24 = 999.5; [L43] unsigned char var_1_25 = 1; [L44] float var_1_26 = 9999999.5; [L45] unsigned char var_1_27 = 25; [L46] unsigned char var_1_28 = 0; [L47] unsigned char var_1_29 = 5; [L48] unsigned char var_1_30 = 25; [L49] signed char var_1_31 = 2; [L50] signed char var_1_32 = -50; [L51] double last_1_var_1_1 = 100.25; [L52] signed long int last_1_var_1_8 = 2; [L53] float last_1_var_1_12 = 50.25; [L54] signed long int last_1_var_1_16 = -500; [L55] unsigned char last_1_var_1_17 = 1; [L56] unsigned char last_1_var_1_19 = 0; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L160] last_1_var_1_1 = var_1_1 [L161] last_1_var_1_8 = var_1_8 [L162] last_1_var_1_12 = var_1_12 [L163] last_1_var_1_16 = var_1_16 [L164] last_1_var_1_17 = var_1_17 [L165] last_1_var_1_19 = var_1_19 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L116] var_1_5 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L117] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L118] var_1_6 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L119] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L120] var_1_7 = __VERIFIER_nondet_double() [L121] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=1000000000] [L121] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=1000000000] [L122] var_1_9 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L123] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L124] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L124] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L125] var_1_10 = __VERIFIER_nondet_long() [L126] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L126] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L127] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L127] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L128] var_1_11 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L129] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L130] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L130] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L131] var_1_14 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L132] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L133] var_1_15 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L134] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L135] var_1_18 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L136] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L137] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L137] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=4, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L138] var_1_21 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L139] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L140] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L140] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=-5, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L141] var_1_23 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_23 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L142] RET assume_abort_if_not(var_1_23 >= -32767) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L143] CALL assume_abort_if_not(var_1_23 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L143] RET assume_abort_if_not(var_1_23 <= 32766) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=1, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L144] var_1_25 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L145] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L146] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L146] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_26=19999999/2, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L147] var_1_26 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L148] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=0, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L149] var_1_28 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L150] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L151] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L151] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=5, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L152] var_1_29 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L153] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L154] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L154] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=-50, var_1_8=2, var_1_9=536870911] [L155] var_1_32 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_32 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L156] RET assume_abort_if_not(var_1_32 >= -126) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L157] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L157] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=-4, var_1_21=0, var_1_22=-4, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L176] RET updateVariables() [L177] CALL step() [L60] var_1_20 = var_1_21 [L61] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1999/2, var_1_25=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L62] COND TRUE var_1_25 || (var_1_20 >= var_1_21) [L63] var_1_24 = ((((16.75f) < (var_1_26)) ? (16.75f) : (var_1_26))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L65] (var_1_25 && var_1_28) && (var_1_20 > (var_1_21 & var_1_22)) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L65] COND FALSE !((var_1_25 && var_1_28) && (var_1_20 > (var_1_21 & var_1_22))) [L68] COND FALSE !(! var_1_28) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=2, var_1_32=16, var_1_8=2, var_1_9=536870911] [L75] COND TRUE \read(var_1_28) [L76] var_1_31 = (((((((var_1_32) < (16)) ? (var_1_32) : (16))) < 0 ) ? -((((var_1_32) < (16)) ? (var_1_32) : (16))) : ((((var_1_32) < (16)) ? (var_1_32) : (16))))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_8=2, var_1_9=536870911] [L78] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_8=2, var_1_9=536870911] [L79] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_8=2, var_1_9=536870911] [L85] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_8=2, var_1_9=536870911] [L92] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L93] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_8=999, var_1_9=536870911] [L94] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L95] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_7=2, var_1_8=999, var_1_9=536870911] [L97] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) [L98] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_7=2, var_1_8=999, var_1_9=536870911] [L99] COND TRUE stepLocal_2 < var_1_11 [L100] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_7=2, var_1_8=999, var_1_9=536870911] [L104] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_7=2, var_1_8=999, var_1_9=536870911] [L105] COND FALSE !(\read(var_1_19)) [L112] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L177] RET step() [L178] CALL, EXPR property() [L168-L169] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=67/4, var_1_25=0, var_1_26=0, var_1_27=25, var_1_28=1, var_1_29=0, var_1_30=25, var_1_31=16, var_1_32=16, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 1656 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 978 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649 IncrementalHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 678 mSDtfsCounter, 649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 623 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=5, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 201 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1324 NumberOfCodeBlocks, 1324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2118 SizeOfPredicates, 1 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8938/9100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:08:29,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff39960e1869a9d289df842bb5f83c21f1a0a1866b31bb4ed9efa0f1d167781c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:08:31,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:08:31,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:08:31,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:08:31,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:08:31,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:08:31,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:08:31,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:08:31,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:08:31,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:08:31,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:08:31,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:08:31,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:08:31,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:08:31,388 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:08:31,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:08:31,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:08:31,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:08:31,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:08:31,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:08:31,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:08:31,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:08:31,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:08:31,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:08:31,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:08:31,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:08:31,392 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:08:31,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:08:31,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:08:31,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:08:31,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:08:31,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:08:31,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:08:31,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:08:31,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:31,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:08:31,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:08:31,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:08:31,395 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:08:31,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:08:31,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:08:31,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:08:31,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:08:31,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:08:31,397 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:08:31,397 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff39960e1869a9d289df842bb5f83c21f1a0a1866b31bb4ed9efa0f1d167781c [2024-10-13 01:08:31,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:08:31,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:08:31,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:08:31,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:08:31,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:08:31,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:33,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:08:33,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:08:33,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:33,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6003614/e38613319f21476f86f4fa05e16708db/FLAGb414cbb6f [2024-10-13 01:08:33,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6003614/e38613319f21476f86f4fa05e16708db [2024-10-13 01:08:33,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:08:33,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:08:33,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:33,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:08:33,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:08:33,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:33,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcedf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33, skipping insertion in model container [2024-10-13 01:08:33,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:33,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:08:33,776 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_fillercodesize_ps-cn-25_file-6.i[914,927] [2024-10-13 01:08:33,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:33,868 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:08:33,881 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_fillercodesize_ps-cn-25_file-6.i[914,927] [2024-10-13 01:08:33,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:08:33,949 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:08:33,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33 WrapperNode [2024-10-13 01:08:33,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:08:33,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:33,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:08:33,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:08:33,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:33,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,015 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-10-13 01:08:34,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:08:34,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:08:34,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:08:34,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:08:34,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,068 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-13 01:08:34,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:08:34,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:08:34,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:08:34,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:08:34,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (1/1) ... [2024-10-13 01:08:34,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:08:34,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:08:34,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:08:34,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:08:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:08:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:08:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:08:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:08:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:08:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:08:34,264 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:08:34,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:08:57,200 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 01:08:57,201 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:08:57,261 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:08:57,262 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:08:57,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:57 BoogieIcfgContainer [2024-10-13 01:08:57,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:08:57,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:08:57,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:08:57,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:08:57,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:08:33" (1/3) ... [2024-10-13 01:08:57,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9482ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:57, skipping insertion in model container [2024-10-13 01:08:57,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:33" (2/3) ... [2024-10-13 01:08:57,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9482ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:57, skipping insertion in model container [2024-10-13 01:08:57,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:57" (3/3) ... [2024-10-13 01:08:57,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-6.i [2024-10-13 01:08:57,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:08:57,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:08:57,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:08:57,366 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;@6dd5a19a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:08:57,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:08:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:08:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 01:08:57,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:08:57,385 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:08:57,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:08:57,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:08:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1077516253, now seen corresponding path program 1 times [2024-10-13 01:08:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:08:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121285768] [2024-10-13 01:08:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:08:57,402 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-13 01:08:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:08:57,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:08:57,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:08:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:08:58,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:08:58,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:08:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-13 01:08:58,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:08:58,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:08:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121285768] [2024-10-13 01:08:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121285768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:08:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:08:58,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:08:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238709877] [2024-10-13 01:08:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:08:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:08:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:08:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:08:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:08:58,245 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:09:02,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:09:02,920 INFO L93 Difference]: Finished difference Result 143 states and 256 transitions. [2024-10-13 01:09:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:09:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-10-13 01:09:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:09:03,035 INFO L225 Difference]: With dead ends: 143 [2024-10-13 01:09:03,035 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 01:09:03,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-13 01:09:03,040 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:09:03,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 01:09:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 01:09:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 01:09:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:09:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-13 01:09:03,078 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 163 [2024-10-13 01:09:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:09:03,078 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-13 01:09:03,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:09:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-13 01:09:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 01:09:03,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:09:03,086 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:09:03,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:09:03,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:09:03,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:09:03,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:09:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1225331043, now seen corresponding path program 1 times [2024-10-13 01:09:03,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:09:03,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017391292] [2024-10-13 01:09:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:09:03,290 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-13 01:09:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:09:03,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:09:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:09:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:09:04,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:09:04,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:09:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:09:08,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:09:08,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:09:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017391292] [2024-10-13 01:09:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017391292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:09:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:09:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:09:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130160851] [2024-10-13 01:09:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:09:08,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:09:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:09:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:09:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:09:08,873 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:09:13,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:17,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:21,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:25,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:29,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:09:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:09:29,968 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2024-10-13 01:09:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:09:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-10-13 01:09:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:09:30,094 INFO L225 Difference]: With dead ends: 212 [2024-10-13 01:09:30,094 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 01:09:30,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:09:30,096 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 77 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:09:30,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 320 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 21.0s Time] [2024-10-13 01:09:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 01:09:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2024-10-13 01:09:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 01:09:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 196 transitions. [2024-10-13 01:09:30,130 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 196 transitions. Word has length 163 [2024-10-13 01:09:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:09:30,133 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 196 transitions. [2024-10-13 01:09:30,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:09:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 196 transitions. [2024-10-13 01:09:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 01:09:30,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:09:30,136 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:09:30,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:09:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:09:30,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:09:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:09:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1633623817, now seen corresponding path program 1 times [2024-10-13 01:09:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:09:30,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902853479] [2024-10-13 01:09:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:09:30,339 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-13 01:09:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:09:30,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:09:30,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 01:09:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:09:31,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:09:31,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:09:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 679 proven. 78 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-13 01:09:37,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:09:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 01:09:41,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:09:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902853479] [2024-10-13 01:09:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902853479] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:09:41,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:09:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-13 01:09:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939221651] [2024-10-13 01:09:41,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:09:41,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:09:41,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:09:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:09:41,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:09:41,543 INFO L87 Difference]: Start difference. First operand 125 states and 196 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 01:09:50,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []