./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.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 1946ed4429047347ee5ca2d57fa2bb1ba2a855655d99af9207a8bf49f0fcf1ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:37:47,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:37:47,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:37:47,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:37:47,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:37:47,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:37:47,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:37:47,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:37:47,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:37:47,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:37:47,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:37:47,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:37:47,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:37:47,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:37:47,155 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:37:47,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:37:47,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:37:47,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:37:47,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:37:47,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:37:47,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:37:47,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:37:47,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:37:47,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:37:47,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:37:47,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:37:47,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:37:47,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:37:47,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:37:47,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:37:47,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:37:47,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:37:47,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:47,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:37:47,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:37:47,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:37:47,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:37:47,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:37:47,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:37:47,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:37:47,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:37:47,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:37:47,164 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 -> 1946ed4429047347ee5ca2d57fa2bb1ba2a855655d99af9207a8bf49f0fcf1ba [2024-10-13 01:37:47,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:37:47,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:37:47,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:37:47,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:37:47,419 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:37:47,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:37:48,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:37:49,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:37:49,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:37:49,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f208e4b0b/2bb64de2e6ac43ea82c0f51dfcc2fb57/FLAGc09a0f241 [2024-10-13 01:37:49,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f208e4b0b/2bb64de2e6ac43ea82c0f51dfcc2fb57 [2024-10-13 01:37:49,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:37:49,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:37:49,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:49,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:37:49,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:37:49,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:49,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac73b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49, skipping insertion in model container [2024-10-13 01:37:49,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:49,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:37:49,672 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i[919,932] [2024-10-13 01:37:49,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:49,791 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:37:49,806 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i[919,932] [2024-10-13 01:37:49,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:49,908 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:37:49,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49 WrapperNode [2024-10-13 01:37:49,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:49,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:49,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:37:49,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:37:49,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:49,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,003 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-13 01:37:50,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:50,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:37:50,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:37:50,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:37:50,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,036 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:37:50,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:37:50,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:37:50,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:37:50,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:37:50,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (1/1) ... [2024-10-13 01:37:50,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:50,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:37:50,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:37:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:37:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:37:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:37:50,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:37:50,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:37:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:37:50,259 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:37:50,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:37:50,636 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:37:50,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:37:50,692 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:37:50,693 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 01:37:50,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:50 BoogieIcfgContainer [2024-10-13 01:37:50,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:37:50,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:37:50,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:37:50,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:37:50,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:37:49" (1/3) ... [2024-10-13 01:37:50,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e234d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:50, skipping insertion in model container [2024-10-13 01:37:50,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:49" (2/3) ... [2024-10-13 01:37:50,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e234d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:50, skipping insertion in model container [2024-10-13 01:37:50,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:50" (3/3) ... [2024-10-13 01:37:50,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:37:50,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:37:50,716 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:37:50,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:37:50,779 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;@19273424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:37:50,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:37:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:37:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:37:50,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:50,794 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:50,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:50,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1784469527, now seen corresponding path program 1 times [2024-10-13 01:37:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074051894] [2024-10-13 01:37:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074051894] [2024-10-13 01:37:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074051894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:37:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183676360] [2024-10-13 01:37:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:37:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:37:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:51,402 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:37:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:51,459 INFO L93 Difference]: Finished difference Result 174 states and 316 transitions. [2024-10-13 01:37:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:37:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-13 01:37:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:51,472 INFO L225 Difference]: With dead ends: 174 [2024-10-13 01:37:51,472 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 01:37:51,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:51,483 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:51,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 01:37:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 01:37:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:37:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2024-10-13 01:37:51,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 199 [2024-10-13 01:37:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2024-10-13 01:37:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:37:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2024-10-13 01:37:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:37:51,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:51,557 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:37:51,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1552740517, now seen corresponding path program 1 times [2024-10-13 01:37:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58667298] [2024-10-13 01:37:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58667298] [2024-10-13 01:37:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58667298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:52,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933288122] [2024-10-13 01:37:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:52,260 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:52,514 INFO L93 Difference]: Finished difference Result 257 states and 407 transitions. [2024-10-13 01:37:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-13 01:37:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:52,521 INFO L225 Difference]: With dead ends: 257 [2024-10-13 01:37:52,522 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 01:37:52,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:52,525 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:52,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 385 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:37:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 01:37:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 142. [2024-10-13 01:37:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:37:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 223 transitions. [2024-10-13 01:37:52,567 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 223 transitions. Word has length 199 [2024-10-13 01:37:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:52,569 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 223 transitions. [2024-10-13 01:37:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 223 transitions. [2024-10-13 01:37:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 01:37:52,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:52,575 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:37:52,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1548971317, now seen corresponding path program 1 times [2024-10-13 01:37:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:52,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420168103] [2024-10-13 01:37:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420168103] [2024-10-13 01:37:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420168103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:37:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964975419] [2024-10-13 01:37:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:53,124 INFO L87 Difference]: Start difference. First operand 142 states and 223 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:53,433 INFO L93 Difference]: Finished difference Result 328 states and 516 transitions. [2024-10-13 01:37:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:37:53,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-13 01:37:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:53,439 INFO L225 Difference]: With dead ends: 328 [2024-10-13 01:37:53,441 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 01:37:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:37:53,445 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 117 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:53,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 495 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:37:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 01:37:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 225. [2024-10-13 01:37:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 01:37:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 356 transitions. [2024-10-13 01:37:53,490 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 356 transitions. Word has length 200 [2024-10-13 01:37:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:53,491 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 356 transitions. [2024-10-13 01:37:53,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 356 transitions. [2024-10-13 01:37:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 01:37:53,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:53,495 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:53,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:37:53,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:53,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2029035774, now seen corresponding path program 1 times [2024-10-13 01:37:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567302406] [2024-10-13 01:37:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567302406] [2024-10-13 01:37:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567302406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849823715] [2024-10-13 01:37:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:53,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:53,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:53,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:53,900 INFO L87 Difference]: Start difference. First operand 225 states and 356 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:37:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:54,175 INFO L93 Difference]: Finished difference Result 561 states and 892 transitions. [2024-10-13 01:37:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:54,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2024-10-13 01:37:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:54,180 INFO L225 Difference]: With dead ends: 561 [2024-10-13 01:37:54,181 INFO L226 Difference]: Without dead ends: 393 [2024-10-13 01:37:54,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:54,182 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:54,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 350 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:37:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-13 01:37:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2024-10-13 01:37:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 225 states have internal predecessors, (301), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-13 01:37:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 621 transitions. [2024-10-13 01:37:54,252 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 621 transitions. Word has length 201 [2024-10-13 01:37:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:54,253 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 621 transitions. [2024-10-13 01:37:54,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:37:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 621 transitions. [2024-10-13 01:37:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 01:37:54,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:54,256 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:54,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:37:54,256 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:54,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1007967420, now seen corresponding path program 1 times [2024-10-13 01:37:54,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:54,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588391098] [2024-10-13 01:37:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588391098] [2024-10-13 01:37:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588391098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135989023] [2024-10-13 01:37:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:37:54,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:37:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:54,498 INFO L87 Difference]: Start difference. First operand 391 states and 621 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:54,564 INFO L93 Difference]: Finished difference Result 745 states and 1188 transitions. [2024-10-13 01:37:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-13 01:37:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:54,568 INFO L225 Difference]: With dead ends: 745 [2024-10-13 01:37:54,568 INFO L226 Difference]: Without dead ends: 411 [2024-10-13 01:37:54,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:54,571 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 34 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:54,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 289 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:37:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-13 01:37:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 391. [2024-10-13 01:37:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 225 states have (on average 1.32) internal successors, (297), 225 states have internal predecessors, (297), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-13 01:37:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2024-10-13 01:37:54,628 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 201 [2024-10-13 01:37:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:54,628 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2024-10-13 01:37:54,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2024-10-13 01:37:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 01:37:54,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:54,631 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:54,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:37:54,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:54,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1414025184, now seen corresponding path program 1 times [2024-10-13 01:37:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725822766] [2024-10-13 01:37:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:37:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725822766] [2024-10-13 01:37:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725822766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151603316] [2024-10-13 01:37:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:54,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:54,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:54,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:37:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:37:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:55,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:37:55,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 69 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-10-13 01:37:55,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:37:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151603316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:55,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:37:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 01:37:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301872164] [2024-10-13 01:37:55,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:37:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:37:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:37:55,620 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-13 01:37:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:55,853 INFO L93 Difference]: Finished difference Result 589 states and 908 transitions. [2024-10-13 01:37:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:37:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 202 [2024-10-13 01:37:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:55,858 INFO L225 Difference]: With dead ends: 589 [2024-10-13 01:37:55,858 INFO L226 Difference]: Without dead ends: 421 [2024-10-13 01:37:55,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:37:55,860 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 55 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:55,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 194 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:37:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-13 01:37:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 237. [2024-10-13 01:37:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 134 states have internal predecessors, (169), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 01:37:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 361 transitions. [2024-10-13 01:37:55,929 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 361 transitions. Word has length 202 [2024-10-13 01:37:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 361 transitions. [2024-10-13 01:37:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-13 01:37:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 361 transitions. [2024-10-13 01:37:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 01:37:55,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:55,935 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:55,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:37:56,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 01:37:56,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:56,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 392956830, now seen corresponding path program 1 times [2024-10-13 01:37:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36471059] [2024-10-13 01:37:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:37:56,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36471059] [2024-10-13 01:37:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36471059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197152916] [2024-10-13 01:37:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:56,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:37:56,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:37:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:56,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:37:56,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-10-13 01:37:56,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:37:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197152916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:57,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:37:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 01:37:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132347980] [2024-10-13 01:37:57,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:57,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:37:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:37:57,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:37:57,088 INFO L87 Difference]: Start difference. First operand 237 states and 361 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:37:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:57,334 INFO L93 Difference]: Finished difference Result 437 states and 652 transitions. [2024-10-13 01:37:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:37:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 202 [2024-10-13 01:37:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:57,337 INFO L225 Difference]: With dead ends: 437 [2024-10-13 01:37:57,337 INFO L226 Difference]: Without dead ends: 261 [2024-10-13 01:37:57,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 464 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-10-13 01:37:57,339 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 96 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:57,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 213 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:37:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-13 01:37:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2024-10-13 01:37:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 143 states have internal predecessors, (176), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 01:37:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 368 transitions. [2024-10-13 01:37:57,375 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 368 transitions. Word has length 202 [2024-10-13 01:37:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 368 transitions. [2024-10-13 01:37:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 01:37:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 368 transitions. [2024-10-13 01:37:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 01:37:57,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:57,378 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:57,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:37:57,579 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,SelfDestructingSolverStorable6 [2024-10-13 01:37:57,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -704253874, now seen corresponding path program 1 times [2024-10-13 01:37:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96303195] [2024-10-13 01:37:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:37:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96303195] [2024-10-13 01:37:57,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96303195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:57,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:57,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:37:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872867174] [2024-10-13 01:37:57,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:57,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:37:57,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:57,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:57,888 INFO L87 Difference]: Start difference. First operand 249 states and 368 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:58,105 INFO L93 Difference]: Finished difference Result 554 states and 817 transitions. [2024-10-13 01:37:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:37:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-13 01:37:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:58,108 INFO L225 Difference]: With dead ends: 554 [2024-10-13 01:37:58,109 INFO L226 Difference]: Without dead ends: 355 [2024-10-13 01:37:58,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-10-13 01:37:58,111 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 93 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:58,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 545 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-13 01:37:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2024-10-13 01:37:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 209 states have internal predecessors, (252), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-13 01:37:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 512 transitions. [2024-10-13 01:37:58,161 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 512 transitions. Word has length 203 [2024-10-13 01:37:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 512 transitions. [2024-10-13 01:37:58,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:37:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 512 transitions. [2024-10-13 01:37:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 01:37:58,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:58,165 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:37:58,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -903736937, now seen corresponding path program 1 times [2024-10-13 01:37:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:37:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762803214] [2024-10-13 01:37:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:37:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:37:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 01:37:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 01:37:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 01:37:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 01:37:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:37:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:37:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:37:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 01:37:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:37:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:37:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:37:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:37:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:37:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:37:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:37:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:37:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:37:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:37:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:37:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:37:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:37:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:37:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:37:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:37:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:37:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:37:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:37:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:37:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:37:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:37:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:37:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:37:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:37:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762803214] [2024-10-13 01:37:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762803214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846726118] [2024-10-13 01:37:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:37:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:59,213 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-10-13 01:37:59,215 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-10-13 01:37:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:59,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 01:37:59,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 500 proven. 156 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2024-10-13 01:38:00,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846726118] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:01,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:38:01,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-10-13 01:38:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677598593] [2024-10-13 01:38:01,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:38:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:38:01,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-13 01:38:01,772 INFO L87 Difference]: Start difference. First operand 351 states and 512 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 4 states have call predecessors, (64), 5 states have call successors, (64) [2024-10-13 01:38:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:02,831 INFO L93 Difference]: Finished difference Result 1349 states and 1902 transitions. [2024-10-13 01:38:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 01:38:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 4 states have call predecessors, (64), 5 states have call successors, (64) Word has length 204 [2024-10-13 01:38:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:02,841 INFO L225 Difference]: With dead ends: 1349 [2024-10-13 01:38:02,841 INFO L226 Difference]: Without dead ends: 1063 [2024-10-13 01:38:02,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=424, Invalid=1216, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 01:38:02,845 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 532 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:02,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 921 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:38:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-13 01:38:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 923. [2024-10-13 01:38:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 621 states have (on average 1.2592592592592593) internal successors, (782), 633 states have internal predecessors, (782), 260 states have call successors, (260), 41 states have call predecessors, (260), 41 states have return successors, (260), 248 states have call predecessors, (260), 260 states have call successors, (260) [2024-10-13 01:38:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1302 transitions. [2024-10-13 01:38:03,001 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1302 transitions. Word has length 204 [2024-10-13 01:38:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1302 transitions. [2024-10-13 01:38:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 5 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (64), 4 states have call predecessors, (64), 5 states have call successors, (64) [2024-10-13 01:38:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1302 transitions. [2024-10-13 01:38:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 01:38:03,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:03,004 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:03,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 01:38:03,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:03,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:03,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -903796519, now seen corresponding path program 1 times [2024-10-13 01:38:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:03,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167751899] [2024-10-13 01:38:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:38:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411002693] [2024-10-13 01:38:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:03,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:03,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:38:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:03,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:38:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:03,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:38:03,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:38:03,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:38:03,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 01:38:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:03,882 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:04,035 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:38:04,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:38:04 BoogieIcfgContainer [2024-10-13 01:38:04,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:38:04,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:38:04,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:38:04,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:38:04,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:50" (3/4) ... [2024-10-13 01:38:04,040 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:38:04,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:38:04,042 INFO L158 Benchmark]: Toolchain (without parser) took 14575.99ms. Allocated memory was 138.4MB in the beginning and 360.7MB in the end (delta: 222.3MB). Free memory was 81.9MB in the beginning and 228.8MB in the end (delta: -146.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,042 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:38:04,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.84ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 108.6MB in the end (delta: -26.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.37ms. Allocated memory is still 138.4MB. Free memory was 108.6MB in the beginning and 105.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,043 INFO L158 Benchmark]: Boogie Preprocessor took 51.05ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 101.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,043 INFO L158 Benchmark]: RCFGBuilder took 636.77ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 73.1MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,044 INFO L158 Benchmark]: TraceAbstraction took 13342.53ms. Allocated memory was 138.4MB in the beginning and 360.7MB in the end (delta: 222.3MB). Free memory was 72.3MB in the beginning and 229.8MB in the end (delta: -157.6MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,044 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 360.7MB. Free memory was 229.8MB in the beginning and 228.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:38:04,046 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.18ms. Allocated memory is still 138.4MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.84ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 108.6MB in the end (delta: -26.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.37ms. Allocated memory is still 138.4MB. Free memory was 108.6MB in the beginning and 105.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.05ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 101.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 636.77ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 73.1MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13342.53ms. Allocated memory was 138.4MB in the beginning and 360.7MB in the end (delta: 222.3MB). Free memory was 72.3MB in the beginning and 229.8MB in the end (delta: -157.6MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 360.7MB. Free memory was 229.8MB in the beginning and 228.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] signed char var_1_27 = 5; [L42] signed char var_1_28 = 1; [L43] float var_1_30 = 10.8; [L44] float var_1_31 = 49.2; [L45] float var_1_32 = 0.4; [L46] unsigned char var_1_33 = 10; [L47] unsigned char var_1_37 = 64; [L48] signed char var_1_38 = -8; [L49] unsigned short int var_1_40 = 200; [L50] unsigned long int var_1_42 = 2; [L51] unsigned long int var_1_44 = 10; [L52] unsigned short int var_1_45 = 16; [L53] unsigned char last_1_var_1_1 = 128; [L54] unsigned long int last_1_var_1_12 = 8; [L55] double last_1_var_1_17 = 256.8; [L56] unsigned char last_1_var_1_21 = 1; [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_1 = var_1_1 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_17 = var_1_17 [L203] last_1_var_1_21 = var_1_21 [L213] RET updateLastVariables() [L214] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L154] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L154] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] var_1_10 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] var_1_11 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] var_1_13 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] var_1_15 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_18 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L173] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L175] var_1_23 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L176] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L178] var_1_24 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L179] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L185] var_1_28 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L186] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] var_1_30 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L190] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L191] var_1_31 = __VERIFIER_nondet_float() [L192] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L192] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L193] var_1_32 = __VERIFIER_nondet_float() [L194] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L194] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L195] var_1_37 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_37 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L196] RET assume_abort_if_not(var_1_37 >= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L214] RET updateVariables() [L215] CALL step() [L60] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L61] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L62] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L63] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] unsigned long int stepLocal_1 = last_1_var_1_12; [L71] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L72] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L73] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L74] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L75] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L81] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L84] COND TRUE ! (var_1_17 > var_1_5) [L85] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L89] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L101] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L103] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L104] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L107] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_1 % ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28)))) > var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L114] COND TRUE var_1_32 < ((((var_1_30) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_30) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) [L115] var_1_33 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L121] var_1_38 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L123] var_1_40 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L129] COND FALSE !(((((1.000000095E7f) < 0 ) ? -(1.000000095E7f) : (1.000000095E7f))) < ((9.9999999999996E12f - var_1_31) / var_1_22)) [L134] var_1_42 = 100000u VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L136] var_1_44 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) + (((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) : ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L137] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L140] COND TRUE var_1_19 > ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L141] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L215] RET step() [L216] CALL, EXPR property() [L206-L207] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1129 mSDsluCounter, 3525 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2351 mSDsCounter, 469 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1518 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 469 mSolverCounterUnsat, 1174 mSDtfsCounter, 1518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1871 GetRequests, 1796 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=923occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 410 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2827 NumberOfCodeBlocks, 2827 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2809 ConstructedInterpolants, 0 QuantifiedInterpolants, 8401 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1383 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 27215/27776 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:38:04,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.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 1946ed4429047347ee5ca2d57fa2bb1ba2a855655d99af9207a8bf49f0fcf1ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:38:06,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:38:06,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:38:06,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:38:06,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:38:06,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:38:06,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:38:06,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:38:06,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:38:06,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:38:06,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:38:06,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:38:06,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:38:06,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:38:06,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:38:06,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:38:06,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:38:06,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:38:06,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:38:06,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:38:06,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:38:06,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:38:06,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:38:06,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:38:06,321 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:38:06,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:38:06,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:38:06,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:38:06,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:38:06,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:38:06,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:38:06,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:38:06,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:38:06,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:38:06,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:06,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:38:06,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:38:06,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:38:06,326 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:38:06,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:38:06,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:38:06,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:38:06,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:38:06,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:38:06,328 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:38:06,328 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 -> 1946ed4429047347ee5ca2d57fa2bb1ba2a855655d99af9207a8bf49f0fcf1ba [2024-10-13 01:38:06,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:38:06,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:38:06,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:38:06,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:38:06,647 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:38:06,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:38:08,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:38:08,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:38:08,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:38:08,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100729157/13c6e99fa0864132aa34094046f15ed8/FLAGa97f072fc [2024-10-13 01:38:08,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100729157/13c6e99fa0864132aa34094046f15ed8 [2024-10-13 01:38:08,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:38:08,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:38:08,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:08,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:38:08,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:38:08,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:08" (1/1) ... [2024-10-13 01:38:08,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592002fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:08, skipping insertion in model container [2024-10-13 01:38:08,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:08" (1/1) ... [2024-10-13 01:38:08,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:38:08,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i[919,932] [2024-10-13 01:38:08,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:09,014 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:38:09,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i[919,932] [2024-10-13 01:38:09,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:09,115 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:38:09,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09 WrapperNode [2024-10-13 01:38:09,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:09,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:09,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:38:09,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:38:09,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,184 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-13 01:38:09,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:09,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:38:09,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:38:09,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:38:09,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:38:09,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:38:09,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:38:09,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:38:09,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:38:09,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (1/1) ... [2024-10-13 01:38:09,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:09,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:38:09,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:38:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:38:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:38:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:38:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:38:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:38:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:38:09,437 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:38:09,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:38:28,512 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:38:28,513 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:38:28,575 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:38:28,577 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 01:38:28,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:28 BoogieIcfgContainer [2024-10-13 01:38:28,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:38:28,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:38:28,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:38:28,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:38:28,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:38:08" (1/3) ... [2024-10-13 01:38:28,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc5502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:28, skipping insertion in model container [2024-10-13 01:38:28,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:09" (2/3) ... [2024-10-13 01:38:28,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc5502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:28, skipping insertion in model container [2024-10-13 01:38:28,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:28" (3/3) ... [2024-10-13 01:38:28,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-51.i [2024-10-13 01:38:28,599 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:38:28,599 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:38:28,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:38:28,662 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;@70a9dc14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:38:28,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:38:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:38:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:38:28,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:28,686 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:28,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:28,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1784469527, now seen corresponding path program 1 times [2024-10-13 01:38:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203020960] [2024-10-13 01:38:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:28,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:38:28,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:28,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:38:28,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:38:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:38:30,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-10-13 01:38:30,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:38:30,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:38:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203020960] [2024-10-13 01:38:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203020960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:30,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:30,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:38:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980805358] [2024-10-13 01:38:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:38:30,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:38:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:38:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:30,339 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:34,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:38:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:34,648 INFO L93 Difference]: Finished difference Result 174 states and 316 transitions. [2024-10-13 01:38:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:38:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-13 01:38:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:34,739 INFO L225 Difference]: With dead ends: 174 [2024-10-13 01:38:34,739 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 01:38:34,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:34,745 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:34,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 01:38:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 01:38:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 01:38:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:38:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 135 transitions. [2024-10-13 01:38:34,796 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 135 transitions. Word has length 199 [2024-10-13 01:38:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:34,796 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 135 transitions. [2024-10-13 01:38:34,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 135 transitions. [2024-10-13 01:38:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:38:34,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:34,807 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:34,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:38:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:38:35,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:35,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1552740517, now seen corresponding path program 1 times [2024-10-13 01:38:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310486164] [2024-10-13 01:38:35,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:35,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:38:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:35,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:38:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:38:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:36,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:38:36,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:42,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:38:42,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:38:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310486164] [2024-10-13 01:38:42,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310486164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:42,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:42,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:38:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033992951] [2024-10-13 01:38:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:38:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:38:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:38:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:38:42,533 INFO L87 Difference]: Start difference. First operand 86 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:45,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:38:49,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:38:52,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:38:57,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:38:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:57,301 INFO L93 Difference]: Finished difference Result 257 states and 404 transitions. [2024-10-13 01:38:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:38:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-13 01:38:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:57,391 INFO L225 Difference]: With dead ends: 257 [2024-10-13 01:38:57,391 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 01:38:57,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:57,393 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 86 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 65 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:57,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 382 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 14.6s Time] [2024-10-13 01:38:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 01:38:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 142. [2024-10-13 01:38:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 01:38:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2024-10-13 01:38:57,428 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 222 transitions. Word has length 199 [2024-10-13 01:38:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-10-13 01:38:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 222 transitions. [2024-10-13 01:38:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 01:38:57,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:57,435 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:57,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:38:57,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:38:57,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1548971317, now seen corresponding path program 1 times [2024-10-13 01:38:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:38:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004018796] [2024-10-13 01:38:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:38:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:38:57,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:38:57,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 01:38:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:59,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:38:59,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:39:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:39:05,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:39:05,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:39:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004018796] [2024-10-13 01:39:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004018796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:39:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713167977] [2024-10-13 01:39:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:05,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:39:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:39:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:39:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:39:05,110 INFO L87 Difference]: Start difference. First operand 142 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:39:11,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:39:15,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []