./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:36:53,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:36:53,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:36:53,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:36:53,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:36:53,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:36:53,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:36:53,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:36:53,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:36:53,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:36:53,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:36:53,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:36:53,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:36:53,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:36:53,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:36:53,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:36:53,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:36:53,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:36:53,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:36:53,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:36:53,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:36:53,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:36:53,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:36:53,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:36:53,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:36:53,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:36:53,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:36:53,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:36:53,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:36:53,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:36:53,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:36:53,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:36:53,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:36:53,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:36:53,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:36:53,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:36:53,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:36:53,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:36:53,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:36:53,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:36:53,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:36:53,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:36:53,314 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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2024-11-08 21:36:53,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:36:53,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:36:53,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:36:53,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:36:53,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:36:53,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:36:55,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:36:55,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:36:55,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:36:55,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4128a9b84/76a86bcaba32474aaea446b43f1c5074/FLAG0aa8a1060 [2024-11-08 21:36:55,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4128a9b84/76a86bcaba32474aaea446b43f1c5074 [2024-11-08 21:36:55,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:36:55,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:36:55,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:36:55,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:36:55,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:36:55,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:36:55" (1/1) ... [2024-11-08 21:36:55,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1980453a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:55, skipping insertion in model container [2024-11-08 21:36:55,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:36:55" (1/1) ... [2024-11-08 21:36:55,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:36:55,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-11-08 21:36:55,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:36:55,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:36:55,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-11-08 21:36:55,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:36:56,024 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:36:56,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56 WrapperNode [2024-11-08 21:36:56,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:36:56,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:36:56,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:36:56,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:36:56,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,081 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-08 21:36:56,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:36:56,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:36:56,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:36:56,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:36:56,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:36:56,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:36:56,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:36:56,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:36:56,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:36:56,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (1/1) ... [2024-11-08 21:36:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:36:56,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:36:56,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:36:56,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:36:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:36:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:36:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:36:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:36:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:36:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:36:56,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:36:56,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:36:56,711 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:36:56,711 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:36:56,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:36:56,724 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:36:56,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:36:56 BoogieIcfgContainer [2024-11-08 21:36:56,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:36:56,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:36:56,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:36:56,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:36:56,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:36:55" (1/3) ... [2024-11-08 21:36:56,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ead292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:36:56, skipping insertion in model container [2024-11-08 21:36:56,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:56" (2/3) ... [2024-11-08 21:36:56,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ead292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:36:56, skipping insertion in model container [2024-11-08 21:36:56,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:36:56" (3/3) ... [2024-11-08 21:36:56,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:36:56,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:36:56,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:36:56,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:36:56,821 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;@1f15207c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:36:56,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:36:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:36:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:36:56,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:56,843 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:36:56,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -136715908, now seen corresponding path program 1 times [2024-11-08 21:36:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394713145] [2024-11-08 21:36:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:36:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:36:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:36:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:36:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:36:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:36:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:36:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:36:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:36:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:36:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:36:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:36:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:36:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:36:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:36:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:36:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:36:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:36:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:36:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:36:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:36:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:36:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:36:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:36:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:36:57,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394713145] [2024-11-08 21:36:57,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394713145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:57,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:57,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:36:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257891617] [2024-11-08 21:36:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:36:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:36:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:36:57,431 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:36:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:57,459 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2024-11-08 21:36:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:36:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2024-11-08 21:36:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:57,472 INFO L225 Difference]: With dead ends: 173 [2024-11-08 21:36:57,472 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 21:36:57,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:36:57,478 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:57,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:36:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 21:36:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 21:36:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:36:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-08 21:36:57,525 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 190 [2024-11-08 21:36:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-08 21:36:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:36:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-08 21:36:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:36:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:57,531 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:36:57,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:36:57,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:57,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1655581304, now seen corresponding path program 1 times [2024-11-08 21:36:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:57,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723187181] [2024-11-08 21:36:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:36:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:36:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:36:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:36:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:36:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:36:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:36:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:36:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:36:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:36:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:36:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:36:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:36:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:36:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:36:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:36:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:36:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:36:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:36:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:36:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:36:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:36:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:36:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:36:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:36:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723187181] [2024-11-08 21:36:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723187181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:36:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710075971] [2024-11-08 21:36:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:36:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:36:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:57,948 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:36:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:58,041 INFO L93 Difference]: Finished difference Result 242 states and 377 transitions. [2024-11-08 21:36:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:36:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-08 21:36:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:58,054 INFO L225 Difference]: With dead ends: 242 [2024-11-08 21:36:58,054 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 21:36:58,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:58,059 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 108 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:58,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 251 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:36:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 21:36:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2024-11-08 21:36:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:36:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-11-08 21:36:58,091 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 190 [2024-11-08 21:36:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-11-08 21:36:58,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:36:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-11-08 21:36:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:36:58,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:58,101 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:36:58,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:36:58,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:58,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1913746742, now seen corresponding path program 1 times [2024-11-08 21:36:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717995908] [2024-11-08 21:36:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:36:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:36:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:36:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:36:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:36:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:36:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:36:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:36:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:36:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:36:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:36:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:36:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:36:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:36:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:36:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:36:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:36:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:36:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:36:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:36:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:36:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:36:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:36:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:36:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:36:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717995908] [2024-11-08 21:36:58,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717995908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:58,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:36:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826142821] [2024-11-08 21:36:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:58,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:36:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:36:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:58,418 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:36:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:58,499 INFO L93 Difference]: Finished difference Result 251 states and 388 transitions. [2024-11-08 21:36:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:36:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-08 21:36:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:58,502 INFO L225 Difference]: With dead ends: 251 [2024-11-08 21:36:58,506 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 21:36:58,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:58,508 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 112 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:58,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 341 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:36:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 21:36:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2024-11-08 21:36:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:36:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2024-11-08 21:36:58,530 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 190 [2024-11-08 21:36:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:58,533 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2024-11-08 21:36:58,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:36:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2024-11-08 21:36:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:36:58,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:58,539 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:36:58,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:36:58,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1041333877, now seen corresponding path program 1 times [2024-11-08 21:36:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095869371] [2024-11-08 21:36:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:36:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:36:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:36:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:36:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:36:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:36:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:36:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:36:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:36:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:36:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:36:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:36:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:36:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:36:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:36:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:36:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:36:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:36:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:36:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:36:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:36:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:36:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:36:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:36:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:36:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095869371] [2024-11-08 21:36:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095869371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:36:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781323734] [2024-11-08 21:36:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:36:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:36:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:36:59,698 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:00,139 INFO L93 Difference]: Finished difference Result 305 states and 463 transitions. [2024-11-08 21:37:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:37:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-11-08 21:37:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:00,144 INFO L225 Difference]: With dead ends: 305 [2024-11-08 21:37:00,146 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 21:37:00,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:37:00,150 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 147 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:00,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 427 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:37:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 21:37:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 157. [2024-11-08 21:37:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 94 states have internal predecessors, (120), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:37:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2024-11-08 21:37:00,200 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 191 [2024-11-08 21:37:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:00,201 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2024-11-08 21:37:00,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2024-11-08 21:37:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:37:00,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:00,206 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:00,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:37:00,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:00,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1665285517, now seen corresponding path program 1 times [2024-11-08 21:37:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:37:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783066427] [2024-11-08 21:37:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:37:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:37:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:37:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:37:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:37:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:37:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:37:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:37:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:37:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:37:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:37:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:37:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:37:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:37:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:37:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:37:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:37:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:37:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:37:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:37:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:37:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:37:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:37:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:37:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:37:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:37:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:37:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:37:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:37:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:37:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:37:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:37:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:37:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783066427] [2024-11-08 21:37:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783066427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:37:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:37:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:37:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879531513] [2024-11-08 21:37:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:37:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:37:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:37:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:37:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:37:00,685 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:00,950 INFO L93 Difference]: Finished difference Result 374 states and 569 transitions. [2024-11-08 21:37:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:37:00,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-11-08 21:37:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:00,954 INFO L225 Difference]: With dead ends: 374 [2024-11-08 21:37:00,955 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 21:37:00,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:37:00,957 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 151 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:00,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 604 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:37:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 21:37:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 245. [2024-11-08 21:37:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 151 states have (on average 1.271523178807947) internal successors, (192), 151 states have internal predecessors, (192), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 21:37:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2024-11-08 21:37:01,025 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 191 [2024-11-08 21:37:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:01,026 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2024-11-08 21:37:01,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2024-11-08 21:37:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:37:01,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:01,029 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:37:01,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:01,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1661039659, now seen corresponding path program 1 times [2024-11-08 21:37:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:37:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665164977] [2024-11-08 21:37:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:37:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:37:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:37:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:37:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:37:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:37:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:37:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:37:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:37:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:37:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:37:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:37:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:37:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:37:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:37:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:37:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:37:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:37:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:37:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:37:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:37:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:37:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:37:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:37:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:37:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:37:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:37:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:37:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:37:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:37:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:37:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:37:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:37:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665164977] [2024-11-08 21:37:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665164977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:37:01,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:37:01,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:37:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420568922] [2024-11-08 21:37:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:37:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:37:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:37:01,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:37:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:37:01,822 INFO L87 Difference]: Start difference. First operand 245 states and 372 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:02,204 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2024-11-08 21:37:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:37:02,205 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-11-08 21:37:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:02,207 INFO L225 Difference]: With dead ends: 358 [2024-11-08 21:37:02,208 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 21:37:02,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:37:02,210 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 79 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:02,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 426 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:37:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 21:37:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2024-11-08 21:37:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:37:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2024-11-08 21:37:02,256 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 193 [2024-11-08 21:37:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:02,259 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2024-11-08 21:37:02,259 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2024-11-08 21:37:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:37:02,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:02,262 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:02,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:37:02,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:02,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1923989445, now seen corresponding path program 1 times [2024-11-08 21:37:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:37:02,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070294764] [2024-11-08 21:37:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:37:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:37:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:37:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:37:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:37:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:37:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:37:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:37:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 21:37:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:37:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:37:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:37:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:37:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:37:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:37:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:37:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:37:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:37:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:37:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:37:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:37:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:37:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:37:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:37:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:37:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:37:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:37:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:37:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:37:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:37:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:37:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:37:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:37:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070294764] [2024-11-08 21:37:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070294764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:37:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220877601] [2024-11-08 21:37:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:37:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:37:02,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:37:02,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:37:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:03,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 21:37:03,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:37:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 21:37:03,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:37:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:37:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220877601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:37:03,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:37:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-11-08 21:37:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917155076] [2024-11-08 21:37:03,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:37:03,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 21:37:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:37:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 21:37:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:37:03,878 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-08 21:37:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:05,521 INFO L93 Difference]: Finished difference Result 503 states and 718 transitions. [2024-11-08 21:37:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-08 21:37:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) Word has length 194 [2024-11-08 21:37:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:05,527 INFO L225 Difference]: With dead ends: 503 [2024-11-08 21:37:05,528 INFO L226 Difference]: Without dead ends: 409 [2024-11-08 21:37:05,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=756, Invalid=3026, Unknown=0, NotChecked=0, Total=3782 [2024-11-08 21:37:05,530 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 499 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:05,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 645 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 21:37:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-08 21:37:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 222. [2024-11-08 21:37:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 142 states have (on average 1.232394366197183) internal successors, (175), 143 states have internal predecessors, (175), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-08 21:37:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 317 transitions. [2024-11-08 21:37:05,592 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 317 transitions. Word has length 194 [2024-11-08 21:37:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:05,593 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 317 transitions. [2024-11-08 21:37:05,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-08 21:37:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 317 transitions. [2024-11-08 21:37:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:37:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:05,598 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:05,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:37:05,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:37:05,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 337488585, now seen corresponding path program 1 times [2024-11-08 21:37:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:37:05,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425587694] [2024-11-08 21:37:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:37:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:37:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670483285] [2024-11-08 21:37:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:37:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:37:05,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:37:05,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:37:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:37:06,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:37:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:37:06,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:37:06,399 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:37:06,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:37:06,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:37:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 21:37:06,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:06,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:37:06,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:37:06 BoogieIcfgContainer [2024-11-08 21:37:06,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:37:06,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:37:06,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:37:06,761 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:37:06,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:36:56" (3/4) ... [2024-11-08 21:37:06,764 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:37:06,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:37:06,766 INFO L158 Benchmark]: Toolchain (without parser) took 11110.50ms. Allocated memory was 157.3MB in the beginning and 318.8MB in the end (delta: 161.5MB). Free memory was 102.5MB in the beginning and 209.9MB in the end (delta: -107.4MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,766 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:37:06,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.27ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 84.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.10ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 80.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,766 INFO L158 Benchmark]: Boogie Preprocessor took 67.08ms. Allocated memory is still 157.3MB. Free memory was 80.3MB in the beginning and 74.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,767 INFO L158 Benchmark]: RCFGBuilder took 574.36ms. Allocated memory is still 157.3MB. Free memory was 74.9MB in the beginning and 107.2MB in the end (delta: -32.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,767 INFO L158 Benchmark]: TraceAbstraction took 10033.58ms. Allocated memory was 157.3MB in the beginning and 318.8MB in the end (delta: 161.5MB). Free memory was 106.4MB in the beginning and 209.9MB in the end (delta: -103.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-11-08 21:37:06,768 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 318.8MB. Free memory is still 209.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:37:06,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.27ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 84.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.10ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 80.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.08ms. Allocated memory is still 157.3MB. Free memory was 80.3MB in the beginning and 74.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 574.36ms. Allocated memory is still 157.3MB. Free memory was 74.9MB in the beginning and 107.2MB in the end (delta: -32.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10033.58ms. Allocated memory was 157.3MB in the beginning and 318.8MB in the end (delta: 161.5MB). Free memory was 106.4MB in the beginning and 209.9MB in the end (delta: -103.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 318.8MB. Free memory is still 209.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] float var_1_29 = 63.75; [L42] signed short int var_1_30 = -256; [L43] unsigned char var_1_31 = 0; [L44] double var_1_32 = 99999999999.2; [L45] double var_1_33 = 31.2; [L46] unsigned char var_1_35 = 1; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] unsigned char var_1_38 = 1; [L50] unsigned short int var_1_39 = 4; [L51] unsigned char var_1_40 = 4; [L52] unsigned char var_1_41 = 10; [L53] unsigned long int last_1_var_1_1 = 1000; [L54] unsigned char last_1_var_1_5 = 1; [L55] unsigned long int last_1_var_1_12 = 128; [L56] unsigned char last_1_var_1_13 = 16; [L57] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L182] last_1_var_1_1 = var_1_1 [L183] last_1_var_1_5 = var_1_5 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_13 = var_1_13 [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L136] var_1_8 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L139] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L140] var_1_9 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L141] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L142] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L142] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L143] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L143] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L144] var_1_11 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L145] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L146] var_1_14 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L147] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L148] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L148] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L149] var_1_17 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L150] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L151] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L152] var_1_19 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L153] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L154] var_1_20 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L155] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L156] var_1_27 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L157] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L158] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L158] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L159] var_1_29 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L160] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L161] var_1_32 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L162] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L163] var_1_33 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L164] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L165] var_1_35 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L166] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L167] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L167] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L168] var_1_36 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L169] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L170] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L170] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L171] var_1_39 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L172] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L173] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L173] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L175] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L176] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L176] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L177] var_1_41 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L178] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L179] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L179] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L197] RET updateVariables() [L198] CALL step() [L61] signed long int stepLocal_1 = last_1_var_1_13; [L62] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L63] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L64] COND TRUE \read(last_1_var_1_5) [L65] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L74] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L75] COND TRUE last_1_var_1_13 <= stepLocal_2 [L76] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L80] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L81] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L84] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L85] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L86] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=2] [L89] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L94] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L96] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L97] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L99] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L104] var_1_28 = var_1_29 [L105] var_1_30 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L106] COND FALSE !((((((var_1_32 - var_1_33)) < (var_1_29)) ? ((var_1_32 - var_1_33)) : (var_1_29))) > (var_1_7 * 31.3)) [L111] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L113] COND TRUE (var_1_7 / 25.4f) >= ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) [L114] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L116] COND TRUE ! var_1_5 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L117] EXPR (var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L117] COND TRUE (var_1_13 + var_1_13) >= ((var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39)))) [L118] COND FALSE !(var_1_16 && (4.166 >= var_1_29)) [L121] var_1_38 = (128 - (var_1_39 + var_1_41)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189-L190] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=9, var_1_14=-503, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=32, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1100 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1096 mSDsluCounter, 2827 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1854 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 973 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 850 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=5, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 429 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1921 NumberOfCodeBlocks, 1921 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1718 ConstructedInterpolants, 0 QuantifiedInterpolants, 5886 SizeOfPredicates, 7 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 15474/15660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:37:06,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:37:09,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:37:09,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:37:09,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:37:09,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:37:09,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:37:09,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:37:09,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:37:09,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:37:09,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:37:09,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:37:09,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:37:09,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:37:09,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:37:09,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:37:09,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:37:09,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:37:09,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:37:09,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:37:09,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:37:09,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:37:09,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:37:09,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:37:09,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:37:09,273 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:37:09,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:37:09,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:37:09,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:37:09,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:37:09,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:37:09,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:37:09,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:37:09,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:37:09,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:37:09,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:37:09,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:37:09,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:37:09,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:37:09,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:37:09,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:37:09,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:37:09,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:37:09,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:37:09,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:37:09,282 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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2024-11-08 21:37:09,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:37:09,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:37:09,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:37:09,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:37:09,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:37:09,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:37:11,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:37:11,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:37:11,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:37:11,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ba0454c/d4f9b5711edd403db5f31dd0e3a927cf/FLAG966edb920 [2024-11-08 21:37:11,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ba0454c/d4f9b5711edd403db5f31dd0e3a927cf [2024-11-08 21:37:11,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:37:11,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:37:11,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:37:11,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:37:11,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:37:11,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:11,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b7295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11, skipping insertion in model container [2024-11-08 21:37:11,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:11,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:37:11,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-11-08 21:37:11,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:37:11,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:37:11,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-11-08 21:37:11,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:37:11,957 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:37:11,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11 WrapperNode [2024-11-08 21:37:11,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:37:11,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:37:11,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:37:11,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:37:11,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:11,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,022 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-08 21:37:12,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:37:12,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:37:12,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:37:12,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:37:12,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:37:12,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:37:12,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:37:12,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:37:12,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:37:12,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (1/1) ... [2024-11-08 21:37:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:37:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:37:12,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:37:12,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:37:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:37:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:37:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:37:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:37:12,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:37:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:37:12,304 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:37:12,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:37:23,713 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:37:23,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:37:23,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:37:23,730 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:37:23,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:37:23 BoogieIcfgContainer [2024-11-08 21:37:23,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:37:23,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:37:23,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:37:23,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:37:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:37:11" (1/3) ... [2024-11-08 21:37:23,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad7eac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:37:23, skipping insertion in model container [2024-11-08 21:37:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:37:11" (2/3) ... [2024-11-08 21:37:23,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad7eac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:37:23, skipping insertion in model container [2024-11-08 21:37:23,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:37:23" (3/3) ... [2024-11-08 21:37:23,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-11-08 21:37:23,755 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:37:23,755 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:37:23,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:37:23,825 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;@f8e3753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:37:23,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:37:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:37:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:37:23,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:23,842 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:23,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -571958333, now seen corresponding path program 1 times [2024-11-08 21:37:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:37:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766938229] [2024-11-08 21:37:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:37:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:37:23,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:37:23,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:37:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:24,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:37:24,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:37:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-11-08 21:37:24,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:37:24,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:37:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766938229] [2024-11-08 21:37:24,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766938229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:37:24,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:37:24,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:37:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166513738] [2024-11-08 21:37:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:37:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:37:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:37:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:37:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:37:24,711 INFO L87 Difference]: Start difference. First operand has 88 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:37:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:24,747 INFO L93 Difference]: Finished difference Result 169 states and 300 transitions. [2024-11-08 21:37:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:37:24,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2024-11-08 21:37:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:24,758 INFO L225 Difference]: With dead ends: 169 [2024-11-08 21:37:24,758 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 21:37:24,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:37:24,767 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:24,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:37:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 21:37:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 21:37:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:37:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-08 21:37:24,811 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 190 [2024-11-08 21:37:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:24,812 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-08 21:37:24,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:37:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-08 21:37:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:37:24,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:24,815 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:24,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:37:25,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:37:25,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:25,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1220338879, now seen corresponding path program 1 times [2024-11-08 21:37:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:37:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147274864] [2024-11-08 21:37:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:25,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:37:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:37:25,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:37:25,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:37:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:25,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:37:25,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:37:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:37:27,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:37:27,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:37:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147274864] [2024-11-08 21:37:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147274864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:37:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:37:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:37:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145497800] [2024-11-08 21:37:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:37:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:37:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:37:27,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:37:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:37:27,331 INFO L87 Difference]: Start difference. First operand 84 states and 130 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:37:29,293 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2024-11-08 21:37:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:37:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-08 21:37:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:37:29,321 INFO L225 Difference]: With dead ends: 165 [2024-11-08 21:37:29,321 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 21:37:29,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:37:29,323 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 111 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:37:29,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 184 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 21:37:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 21:37:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 21:37:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:37:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-08 21:37:29,347 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 190 [2024-11-08 21:37:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:37:29,350 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-08 21:37:29,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:37:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-08 21:37:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:37:29,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:37:29,357 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:37:29,382 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 (3)] Ended with exit code 0 [2024-11-08 21:37:29,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:37:29,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:37:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:37:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1800957943, now seen corresponding path program 1 times [2024-11-08 21:37:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:37:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516386855] [2024-11-08 21:37:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:37:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:37:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:37:29,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:37:29,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:37:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:37:30,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:37:30,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:37:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 21:37:35,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:37:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:37:37,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:37:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516386855] [2024-11-08 21:37:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516386855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:37:37,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:37:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-08 21:37:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892368047] [2024-11-08 21:37:37,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:37:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 21:37:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:37:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 21:37:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:37:37,548 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-11-08 21:37:45,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:37:49,617 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 [] [2024-11-08 21:37:53,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:37:57,760 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 [] [2024-11-08 21:37:59,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:38:05,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:38:09,681 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 [] [2024-11-08 21:38:11,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:38:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:38:11,739 INFO L93 Difference]: Finished difference Result 315 states and 480 transitions. [2024-11-08 21:38:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 21:38:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 191 [2024-11-08 21:38:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:38:11,744 INFO L225 Difference]: With dead ends: 315 [2024-11-08 21:38:11,745 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 21:38:11,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-08 21:38:11,747 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 545 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 228 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:38:11,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 603 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 637 Invalid, 6 Unknown, 0 Unchecked, 33.1s Time] [2024-11-08 21:38:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 21:38:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2024-11-08 21:38:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 125 states have (on average 1.312) internal successors, (164), 126 states have internal predecessors, (164), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-08 21:38:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 306 transitions. [2024-11-08 21:38:11,803 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 306 transitions. Word has length 191 [2024-11-08 21:38:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:38:11,804 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 306 transitions. [2024-11-08 21:38:11,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-11-08 21:38:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 306 transitions. [2024-11-08 21:38:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:38:11,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:38:11,813 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:38:11,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:38:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:38:12,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:38:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:38:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155310, now seen corresponding path program 1 times [2024-11-08 21:38:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:38:12,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257163745] [2024-11-08 21:38:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:38:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:38:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:38:12,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:38:12,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:38:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:38:12,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:38:12,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:38:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:38:15,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:38:15,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:38:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257163745] [2024-11-08 21:38:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257163745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:38:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:38:15,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:38:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2191369] [2024-11-08 21:38:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:38:15,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:38:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:38:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:38:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:38:15,885 INFO L87 Difference]: Start difference. First operand 201 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)