./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.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 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:23:15,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:23:15,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:23:15,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:23:15,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:23:15,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:23:15,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:23:15,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:23:15,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:23:15,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:23:15,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:23:15,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:23:15,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:23:15,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:23:15,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:23:15,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:23:15,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:23:15,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:23:15,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:23:15,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:23:15,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:23:15,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:23:15,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:23:15,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:23:15,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:23:15,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:23:15,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:23:15,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:23:15,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:23:15,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:23:15,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:23:15,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:23:15,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:15,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:23:15,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:23:15,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:23:15,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:23:15,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:23:15,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:23:15,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:23:15,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:23:15,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:23:15,287 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 -> 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 [2024-11-10 05:23:15,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:23:15,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:23:15,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:23:15,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:23:15,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:23:15,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:23:17,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:23:17,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:23:17,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:23:17,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ec36704/1aa2537103964bb9a9e2574aef85baf0/FLAG7f286fb82 [2024-11-10 05:23:17,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ec36704/1aa2537103964bb9a9e2574aef85baf0 [2024-11-10 05:23:17,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:23:17,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:23:17,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:17,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:23:17,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:23:17,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b6d259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17, skipping insertion in model container [2024-11-10 05:23:17,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:23:17,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i[918,931] [2024-11-10 05:23:17,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:17,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:23:17,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i[918,931] [2024-11-10 05:23:17,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:17,797 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:23:17,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17 WrapperNode [2024-11-10 05:23:17,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:17,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:17,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:23:17,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:23:17,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,865 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-10 05:23:17,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:17,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:23:17,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:23:17,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:23:17,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,910 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:23:17,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:23:17,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:23:17,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:23:17,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:23:17,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (1/1) ... [2024-11-10 05:23:17,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:17,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:17,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:23:17,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:23:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:23:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:23:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:23:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:23:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:23:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:23:18,160 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:23:18,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:23:18,672 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:23:18,673 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:23:18,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:23:18,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:23:18,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:18 BoogieIcfgContainer [2024-11-10 05:23:18,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:23:18,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:23:18,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:23:18,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:23:18,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:17" (1/3) ... [2024-11-10 05:23:18,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20361f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:18, skipping insertion in model container [2024-11-10 05:23:18,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:17" (2/3) ... [2024-11-10 05:23:18,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20361f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:18, skipping insertion in model container [2024-11-10 05:23:18,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:18" (3/3) ... [2024-11-10 05:23:18,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:23:18,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:23:18,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:23:18,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:23:18,805 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;@3c5a0e1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:23:18,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:23:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:23:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:18,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:18,834 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:18,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:18,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1175651667, now seen corresponding path program 1 times [2024-11-10 05:23:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651211240] [2024-11-10 05:23:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651211240] [2024-11-10 05:23:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651211240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:23:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113508224] [2024-11-10 05:23:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:19,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:23:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:23:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:23:19,599 INFO L87 Difference]: Start difference. First operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:23:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:19,645 INFO L93 Difference]: Finished difference Result 192 states and 333 transitions. [2024-11-10 05:23:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:23:19,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 200 [2024-11-10 05:23:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:19,662 INFO L225 Difference]: With dead ends: 192 [2024-11-10 05:23:19,662 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 05:23:19,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:23:19,673 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:19,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 05:23:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 05:23:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:23:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-11-10 05:23:19,737 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 200 [2024-11-10 05:23:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:19,738 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-11-10 05:23:19,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:23:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-11-10 05:23:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:19,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:19,743 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:19,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:23:19,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:19,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -843188775, now seen corresponding path program 1 times [2024-11-10 05:23:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028982391] [2024-11-10 05:23:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028982391] [2024-11-10 05:23:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028982391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:23:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248714260] [2024-11-10 05:23:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:20,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:23:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:23:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:23:20,580 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:20,973 INFO L93 Difference]: Finished difference Result 281 states and 434 transitions. [2024-11-10 05:23:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:23:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:23:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:20,981 INFO L225 Difference]: With dead ends: 281 [2024-11-10 05:23:20,981 INFO L226 Difference]: Without dead ends: 189 [2024-11-10 05:23:20,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:23:20,984 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 85 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:20,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 464 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:23:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-10 05:23:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 154. [2024-11-10 05:23:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 05:23:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2024-11-10 05:23:21,036 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 200 [2024-11-10 05:23:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:21,039 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2024-11-10 05:23:21,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2024-11-10 05:23:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:21,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:21,046 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:23:21,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:21,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 401575706, now seen corresponding path program 1 times [2024-11-10 05:23:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887513496] [2024-11-10 05:23:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887513496] [2024-11-10 05:23:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887513496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:23:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812179882] [2024-11-10 05:23:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:21,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:23:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:23:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:23:21,438 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:21,684 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2024-11-10 05:23:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:23:21,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:23:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:21,693 INFO L225 Difference]: With dead ends: 339 [2024-11-10 05:23:21,693 INFO L226 Difference]: Without dead ends: 247 [2024-11-10 05:23:21,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:23:21,695 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 73 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:21,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 322 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:23:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-10 05:23:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-11-10 05:23:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 150 states have (on average 1.32) internal successors, (198), 150 states have internal predecessors, (198), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 05:23:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 378 transitions. [2024-11-10 05:23:21,744 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 378 transitions. Word has length 200 [2024-11-10 05:23:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:21,745 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 378 transitions. [2024-11-10 05:23:21,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 378 transitions. [2024-11-10 05:23:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:21,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:21,748 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:23:21,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:21,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1289079387, now seen corresponding path program 1 times [2024-11-10 05:23:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524914047] [2024-11-10 05:23:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524914047] [2024-11-10 05:23:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524914047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:22,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:23:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197313356] [2024-11-10 05:23:22,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:23:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:23:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:23:22,548 INFO L87 Difference]: Start difference. First operand 244 states and 378 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:22,837 INFO L93 Difference]: Finished difference Result 664 states and 1030 transitions. [2024-11-10 05:23:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:23:22,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-10 05:23:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:22,845 INFO L225 Difference]: With dead ends: 664 [2024-11-10 05:23:22,846 INFO L226 Difference]: Without dead ends: 478 [2024-11-10 05:23:22,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-11-10 05:23:22,851 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 162 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:22,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 426 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:23:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-10 05:23:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 423. [2024-11-10 05:23:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 267 states have internal predecessors, (358), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-10 05:23:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 658 transitions. [2024-11-10 05:23:22,952 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 658 transitions. Word has length 200 [2024-11-10 05:23:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:22,953 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 658 transitions. [2024-11-10 05:23:22,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 658 transitions. [2024-11-10 05:23:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:22,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:22,957 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:23:22,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2044273892, now seen corresponding path program 1 times [2024-11-10 05:23:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104725989] [2024-11-10 05:23:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:23:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104725989] [2024-11-10 05:23:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104725989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:23:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016553154] [2024-11-10 05:23:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:23,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:23:23,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 05:23:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:23,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:23:23,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-10 05:23:24,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:23:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:23:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016553154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:23:24,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:23:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 05:23:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186453063] [2024-11-10 05:23:24,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:23:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:23:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:23:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:23:24,597 INFO L87 Difference]: Start difference. First operand 423 states and 658 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-10 05:23:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:24,894 INFO L93 Difference]: Finished difference Result 816 states and 1251 transitions. [2024-11-10 05:23:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:23:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 200 [2024-11-10 05:23:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:24,901 INFO L225 Difference]: With dead ends: 816 [2024-11-10 05:23:24,901 INFO L226 Difference]: Without dead ends: 455 [2024-11-10 05:23:24,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:23:24,905 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 57 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:24,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 274 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:23:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-10 05:23:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 443. [2024-11-10 05:23:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 282 states have internal predecessors, (361), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-10 05:23:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 661 transitions. [2024-11-10 05:23:24,988 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 661 transitions. Word has length 200 [2024-11-10 05:23:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:24,988 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 661 transitions. [2024-11-10 05:23:24,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-10 05:23:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 661 transitions. [2024-11-10 05:23:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:23:24,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:24,991 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:25,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 05:23:25,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:25,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash 788651666, now seen corresponding path program 1 times [2024-11-10 05:23:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463537549] [2024-11-10 05:23:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463537549] [2024-11-10 05:23:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463537549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:23:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847253313] [2024-11-10 05:23:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:25,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:23:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:23:25,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:23:25,667 INFO L87 Difference]: Start difference. First operand 443 states and 661 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:26,041 INFO L93 Difference]: Finished difference Result 944 states and 1407 transitions. [2024-11-10 05:23:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:23:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-10 05:23:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:26,046 INFO L225 Difference]: With dead ends: 944 [2024-11-10 05:23:26,046 INFO L226 Difference]: Without dead ends: 567 [2024-11-10 05:23:26,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:23:26,048 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:26,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 487 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:23:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-10 05:23:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 448. [2024-11-10 05:23:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 287 states have (on average 1.278745644599303) internal successors, (367), 287 states have internal predecessors, (367), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-10 05:23:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 667 transitions. [2024-11-10 05:23:26,131 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 667 transitions. Word has length 201 [2024-11-10 05:23:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:26,131 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 667 transitions. [2024-11-10 05:23:26,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 667 transitions. [2024-11-10 05:23:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:23:26,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:26,134 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:23:26,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:26,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 819671473, now seen corresponding path program 1 times [2024-11-10 05:23:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479826169] [2024-11-10 05:23:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479826169] [2024-11-10 05:23:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479826169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:23:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304388167] [2024-11-10 05:23:26,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:26,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:23:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:23:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:23:26,402 INFO L87 Difference]: Start difference. First operand 448 states and 667 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:26,965 INFO L93 Difference]: Finished difference Result 1287 states and 1909 transitions. [2024-11-10 05:23:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:23:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-10 05:23:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:26,973 INFO L225 Difference]: With dead ends: 1287 [2024-11-10 05:23:26,973 INFO L226 Difference]: Without dead ends: 910 [2024-11-10 05:23:26,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:23:26,977 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 503 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:26,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 681 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:23:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-10 05:23:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 818. [2024-11-10 05:23:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 525 states have (on average 1.2780952380952382) internal successors, (671), 529 states have internal predecessors, (671), 270 states have call successors, (270), 22 states have call predecessors, (270), 22 states have return successors, (270), 266 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-10 05:23:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1211 transitions. [2024-11-10 05:23:27,166 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1211 transitions. Word has length 201 [2024-11-10 05:23:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:27,166 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1211 transitions. [2024-11-10 05:23:27,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1211 transitions. [2024-11-10 05:23:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:27,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:27,169 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:23:27,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2075945305, now seen corresponding path program 1 times [2024-11-10 05:23:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647634468] [2024-11-10 05:23:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:23:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647634468] [2024-11-10 05:23:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647634468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:23:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200701737] [2024-11-10 05:23:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:27,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:23:27,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:23:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:27,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:23:27,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 54 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-11-10 05:23:27,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:23:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:23:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200701737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:23:28,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:23:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 05:23:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20448050] [2024-11-10 05:23:28,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:23:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:23:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:23:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:23:28,228 INFO L87 Difference]: Start difference. First operand 818 states and 1211 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-10 05:23:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:28,561 INFO L93 Difference]: Finished difference Result 1645 states and 2392 transitions. [2024-11-10 05:23:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:23:28,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 202 [2024-11-10 05:23:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:28,582 INFO L225 Difference]: With dead ends: 1645 [2024-11-10 05:23:28,582 INFO L226 Difference]: Without dead ends: 896 [2024-11-10 05:23:28,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:23:28,587 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:28,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 233 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:23:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-10 05:23:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 850. [2024-11-10 05:23:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 548 states have (on average 1.2354014598540146) internal successors, (677), 552 states have internal predecessors, (677), 270 states have call successors, (270), 31 states have call predecessors, (270), 31 states have return successors, (270), 266 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-10 05:23:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1217 transitions. [2024-11-10 05:23:28,730 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1217 transitions. Word has length 202 [2024-11-10 05:23:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1217 transitions. [2024-11-10 05:23:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-10 05:23:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1217 transitions. [2024-11-10 05:23:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 05:23:28,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:28,734 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:28,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 05:23:28,935 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,SelfDestructingSolverStorable7 [2024-11-10 05:23:28,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:28,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 128518665, now seen corresponding path program 1 times [2024-11-10 05:23:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:28,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170956351] [2024-11-10 05:23:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:23:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:23:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:23:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:23:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:23:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:23:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:23:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:23:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:23:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:23:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:23:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:23:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:23:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:23:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:23:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:23:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:23:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170956351] [2024-11-10 05:23:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170956351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:23:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768548863] [2024-11-10 05:23:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:29,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:23:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:23:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:23:29,188 INFO L87 Difference]: Start difference. First operand 850 states and 1217 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:29,441 INFO L93 Difference]: Finished difference Result 1628 states and 2333 transitions. [2024-11-10 05:23:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:23:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 204 [2024-11-10 05:23:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:29,451 INFO L225 Difference]: With dead ends: 1628 [2024-11-10 05:23:29,451 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 05:23:29,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-11-10 05:23:29,457 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 63 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:29,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 311 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:23:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 05:23:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 850. [2024-11-10 05:23:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 548 states have (on average 1.2281021897810218) internal successors, (673), 552 states have internal predecessors, (673), 270 states have call successors, (270), 31 states have call predecessors, (270), 31 states have return successors, (270), 266 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-10 05:23:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1213 transitions. [2024-11-10 05:23:29,580 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1213 transitions. Word has length 204 [2024-11-10 05:23:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:29,581 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1213 transitions. [2024-11-10 05:23:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:23:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1213 transitions. [2024-11-10 05:23:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 05:23:29,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:29,584 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:29,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 05:23:29,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:29,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1016022346, now seen corresponding path program 1 times [2024-11-10 05:23:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520966565] [2024-11-10 05:23:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:23:29,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807867984] [2024-11-10 05:23:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:29,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:23:29,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 05:23:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:23:29,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:23:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:23:30,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:23:30,184 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:23:30,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:23:30,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:23:30,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:30,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:30,555 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:23:30,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:23:30 BoogieIcfgContainer [2024-11-10 05:23:30,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:23:30,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:23:30,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:23:30,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:23:30,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:18" (3/4) ... [2024-11-10 05:23:30,562 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:23:30,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:23:30,564 INFO L158 Benchmark]: Toolchain (without parser) took 13180.20ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 100.0MB in the beginning and 210.1MB in the end (delta: -110.1MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,564 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:23:30,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.35ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 82.0MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.85ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 78.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,565 INFO L158 Benchmark]: Boogie Preprocessor took 68.52ms. Allocated memory is still 155.2MB. Free memory was 78.6MB in the beginning and 74.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,566 INFO L158 Benchmark]: IcfgBuilder took 765.32ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 110.9MB in the end (delta: -36.1MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,566 INFO L158 Benchmark]: TraceAbstraction took 11854.75ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 109.6MB in the beginning and 210.1MB in the end (delta: -100.5MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2024-11-10 05:23:30,566 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 325.1MB. Free memory is still 210.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:23:30,568 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.23ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.35ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 82.0MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.85ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 78.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.52ms. Allocated memory is still 155.2MB. Free memory was 78.6MB in the beginning and 74.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 765.32ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 110.9MB in the end (delta: -36.1MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11854.75ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 109.6MB in the beginning and 210.1MB in the end (delta: -100.5MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 325.1MB. Free memory is still 210.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 79, overapproximation of bitwiseAnd at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 4.75; [L38] double var_1_22 = 4.6; [L39] unsigned char var_1_23 = 0; [L40] signed long int var_1_28 = 8; [L41] signed long int var_1_30 = 5; [L42] signed long int var_1_31 = 100; [L43] float var_1_34 = 31.8; [L44] unsigned char var_1_35 = 0; [L45] unsigned char var_1_36 = 0; [L46] unsigned long int var_1_37 = 1; [L47] signed long int var_1_38 = 500; [L48] unsigned long int var_1_39 = 2882328056; [L49] unsigned short int var_1_40 = 5; [L50] unsigned short int var_1_41 = 2; [L51] unsigned short int var_1_42 = 50; [L52] unsigned short int var_1_43 = 4; [L53] unsigned char var_1_44 = 0; [L54] signed long int last_1_var_1_1 = 0; [L55] signed long int last_1_var_1_5 = 2; [L56] signed short int last_1_var_1_6 = -10; [L57] unsigned long int last_1_var_1_7 = 1; [L58] float last_1_var_1_14 = 5.4; [L59] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_5 = var_1_5 [L187] last_1_var_1_6 = var_1_6 [L188] last_1_var_1_7 = var_1_7 [L189] last_1_var_1_14 = var_1_14 [L190] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L137] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L140] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L144] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L144] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L147] var_1_15 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L148] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L149] var_1_16 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L151] var_1_20 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L153] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L153] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L154] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L154] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L159] var_1_30 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L161] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L161] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L162] var_1_31 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L163] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L164] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L164] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L165] var_1_36 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L166] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L167] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L167] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L168] var_1_38 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L169] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L170] CALL assume_abort_if_not(var_1_38 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L170] RET assume_abort_if_not(var_1_38 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L171] var_1_39 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L172] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L173] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L173] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L175] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L176] CALL assume_abort_if_not(var_1_41 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L176] RET assume_abort_if_not(var_1_41 <= 32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L178] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L179] CALL assume_abort_if_not(var_1_42 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L179] RET assume_abort_if_not(var_1_42 <= 16384) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L180] var_1_43 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L181] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L182] CALL assume_abort_if_not(var_1_43 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L182] RET assume_abort_if_not(var_1_43 <= 16383) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L201] RET updateVariables() [L202] CALL step() [L63] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L66] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L68] var_1_40 = (var_1_41 + (var_1_42 + var_1_43)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L69] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L70] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L74] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L75] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L78] COND TRUE (32 / var_1_20) > -500 [L79] var_1_19 = ((((var_1_21 - var_1_22) < 0 ) ? -(var_1_21 - var_1_22) : (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L81] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L82] COND TRUE var_1_10 && (1 >= var_1_17) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L83] COND TRUE \read(var_1_10) [L84] var_1_23 = var_1_10 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L88] COND TRUE (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - (var_1_20 + var_1_38)) <= var_1_1 [L89] var_1_37 = ((((var_1_30) > (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31)))))) ? (var_1_30) : (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31))))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L91] signed long int stepLocal_3 = var_1_1; [L92] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L93] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L98] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L99] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L106] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L108] EXPR var_1_20 & var_1_1 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L108] COND TRUE (var_1_20 & var_1_1) >= var_1_1 [L109] var_1_28 = (((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) < 0 ) ? -((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) : ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L115] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L116] COND TRUE var_1_6 < stepLocal_0 [L117] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L119] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=4294967296, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L120] COND TRUE (- 8u) >= stepLocal_4 [L121] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L125] COND TRUE var_1_31 > var_1_1 [L126] var_1_34 = var_1_22 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L128] EXPR var_1_20 & -100 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L128] COND FALSE !((var_1_20 & -100) <= var_1_6) [L131] COND TRUE var_1_7 <= var_1_6 [L132] var_1_44 = ((1 >= var_1_17) && var_1_36) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=4294967286, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=10, var_1_22=4, var_1_23=1, var_1_28=10, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=1, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=4294967286] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1192 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1181 mSDsluCounter, 3342 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2038 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1137 IncrementalHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 1304 mSDtfsCounter, 1137 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 1382 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 365 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2618 NumberOfCodeBlocks, 2618 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2599 ConstructedInterpolants, 0 QuantifiedInterpolants, 6969 SizeOfPredicates, 1 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 22215/22620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:23:30,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.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 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:23:32,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:23:33,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:23:33,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:23:33,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:23:33,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:23:33,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:23:33,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:23:33,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:23:33,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:23:33,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:23:33,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:23:33,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:23:33,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:23:33,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:23:33,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:23:33,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:23:33,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:23:33,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:23:33,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:23:33,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:23:33,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:23:33,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:23:33,097 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:23:33,097 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:23:33,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:23:33,097 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:23:33,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:23:33,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:23:33,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:23:33,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:23:33,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:23:33,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:23:33,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:23:33,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:33,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:23:33,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:23:33,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:23:33,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:23:33,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:23:33,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:23:33,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:23:33,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:23:33,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:23:33,104 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 -> 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 [2024-11-10 05:23:33,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:23:33,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:23:33,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:23:33,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:23:33,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:23:33,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:23:35,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:23:35,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:23:35,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:23:35,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4bf44056/a3f3495988bb4df98970b987faf81841/FLAGd44a44b63 [2024-11-10 05:23:35,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4bf44056/a3f3495988bb4df98970b987faf81841 [2024-11-10 05:23:35,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:23:35,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:23:35,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:35,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:23:35,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:23:35,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff7ea5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35, skipping insertion in model container [2024-11-10 05:23:35,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:23:35,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i[918,931] [2024-11-10 05:23:35,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:35,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:23:35,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i[918,931] [2024-11-10 05:23:35,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:35,778 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:23:35,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35 WrapperNode [2024-11-10 05:23:35,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:35,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:35,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:23:35,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:23:35,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,850 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-10 05:23:35,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:35,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:23:35,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:23:35,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:23:35,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,910 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:23:35,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:23:35,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:23:35,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:23:35,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:23:35,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (1/1) ... [2024-11-10 05:23:35,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:35,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:36,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:23:36,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:23:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:23:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:23:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:23:36,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:23:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:23:36,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:23:36,181 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:23:36,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:24:04,478 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:24:04,479 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:24:04,495 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:24:04,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:24:04,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:04 BoogieIcfgContainer [2024-11-10 05:24:04,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:24:04,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:24:04,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:24:04,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:24:04,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:35" (1/3) ... [2024-11-10 05:24:04,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5044b335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:04, skipping insertion in model container [2024-11-10 05:24:04,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:35" (2/3) ... [2024-11-10 05:24:04,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5044b335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:04, skipping insertion in model container [2024-11-10 05:24:04,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:04" (3/3) ... [2024-11-10 05:24:04,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2024-11-10 05:24:04,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:24:04,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:24:04,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:24:04,605 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;@26d7703b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:24:04,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:24:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:24:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 05:24:04,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:04,633 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:24:04,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 546965717, now seen corresponding path program 1 times [2024-11-10 05:24:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180622497] [2024-11-10 05:24:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:24:04,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:04,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:24:04,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 05:24:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:06,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:24:06,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-11-10 05:24:06,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:24:06,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180622497] [2024-11-10 05:24:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180622497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:24:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:24:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:24:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896386980] [2024-11-10 05:24:06,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:06,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:24:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:24:06,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:24:06,894 INFO L87 Difference]: Start difference. First operand has 94 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:24:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:06,942 INFO L93 Difference]: Finished difference Result 180 states and 313 transitions. [2024-11-10 05:24:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:24:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-10 05:24:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:06,955 INFO L225 Difference]: With dead ends: 180 [2024-11-10 05:24:06,956 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 05:24:06,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:24:06,967 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:06,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:24:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 05:24:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 05:24:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 05:24:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-10 05:24:07,037 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 198 [2024-11-10 05:24:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:07,038 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-10 05:24:07,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 05:24:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-10 05:24:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 05:24:07,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:07,045 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:24:07,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 05:24:07,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:24:07,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:07,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1764975323, now seen corresponding path program 1 times [2024-11-10 05:24:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491318609] [2024-11-10 05:24:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:24:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:07,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:24:07,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 05:24:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:09,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 05:24:09,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 05:24:31,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:24:31,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491318609] [2024-11-10 05:24:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491318609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:24:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:24:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:24:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957090203] [2024-11-10 05:24:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:24:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:24:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:24:31,034 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 05:24:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []