./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-ps-ci_file-72.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 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:58:25,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:58:25,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:58:25,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:58:25,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:58:25,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:58:25,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:58:25,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:58:25,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:58:25,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:58:25,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:58:25,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:58:25,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:58:25,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:58:25,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:58:25,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:58:25,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:58:25,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:58:25,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:58:25,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:58:25,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:58:25,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:58:25,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:58:25,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:58:25,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:58:25,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:58:25,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:58:25,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:58:25,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:58:25,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:58:25,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:58:25,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:58:25,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:58:25,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:58:25,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:58:25,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:58:25,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:58:25,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:58:25,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:58:25,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:58:25,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:58:25,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:58:25,211 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 -> 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 [2024-11-12 03:58:25,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:58:25,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:58:25,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:58:25,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:58:25,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:58:25,526 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-ps-ci_file-72.i [2024-11-12 03:58:27,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:58:27,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:58:27,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-12 03:58:27,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6f024d5/7bfc6e601f794913be897c2c2f65f219/FLAG0404e7442 [2024-11-12 03:58:27,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6f024d5/7bfc6e601f794913be897c2c2f65f219 [2024-11-12 03:58:27,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:58:27,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:58:27,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:58:27,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:58:27,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:58:27,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf18559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27, skipping insertion in model container [2024-11-12 03:58:27,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:58:27,508 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-ps-ci_file-72.i[919,932] [2024-11-12 03:58:27,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:58:27,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:58:27,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i[919,932] [2024-11-12 03:58:27,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:58:27,694 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:58:27,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27 WrapperNode [2024-11-12 03:58:27,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:58:27,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:58:27,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:58:27,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:58:27,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,779 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-11-12 03:58:27,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:58:27,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:58:27,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:58:27,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:58:27,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,825 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-12 03:58:27,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:58:27,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:58:27,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:58:27,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:58:27,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (1/1) ... [2024-11-12 03:58:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:58:27,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:27,891 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-12 03:58:27,896 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-12 03:58:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:58:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:58:27,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:58:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:58:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:58:27,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:58:28,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:58:28,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:58:28,484 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 03:58:28,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:58:28,498 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:58:28,499 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:58:28,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:58:28 BoogieIcfgContainer [2024-11-12 03:58:28,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:58:28,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:58:28,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:58:28,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:58:28,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:58:27" (1/3) ... [2024-11-12 03:58:28,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9ef141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:58:28, skipping insertion in model container [2024-11-12 03:58:28,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:27" (2/3) ... [2024-11-12 03:58:28,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9ef141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:58:28, skipping insertion in model container [2024-11-12 03:58:28,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:58:28" (3/3) ... [2024-11-12 03:58:28,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-12 03:58:28,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:58:28,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:58:28,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:58:28,645 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;@5b948b77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:58:28,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:58:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 03:58:28,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:28,662 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:28,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:28,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1497202573, now seen corresponding path program 1 times [2024-11-12 03:58:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312894361] [2024-11-12 03:58:28,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312894361] [2024-11-12 03:58:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312894361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:58:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066501181] [2024-11-12 03:58:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:58:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:58:29,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:58:29,225 INFO L87 Difference]: Start difference. First operand has 96 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:29,266 INFO L93 Difference]: Finished difference Result 185 states and 322 transitions. [2024-11-12 03:58:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:58:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-12 03:58:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:29,278 INFO L225 Difference]: With dead ends: 185 [2024-11-12 03:58:29,279 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 03:58:29,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:58:29,288 INFO L435 NwaCegarLoop]: 143 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, 143 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-12 03:58:29,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:58:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 03:58:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 03:58:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-11-12 03:58:29,347 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 173 [2024-11-12 03:58:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:29,348 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-11-12 03:58:29,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-11-12 03:58:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 03:58:29,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:29,353 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:29,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:58:29,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:29,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash -794048443, now seen corresponding path program 1 times [2024-11-12 03:58:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305253520] [2024-11-12 03:58:29,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:30,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305253520] [2024-11-12 03:58:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305253520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:58:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386185698] [2024-11-12 03:58:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:30,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:58:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:30,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:58:30,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:58:30,043 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:30,113 INFO L93 Difference]: Finished difference Result 198 states and 306 transitions. [2024-11-12 03:58:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:58:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 03:58:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:30,118 INFO L225 Difference]: With dead ends: 198 [2024-11-12 03:58:30,118 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 03:58:30,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-12 03:58:30,120 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:30,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:58:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 03:58:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2024-11-12 03:58:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 149 transitions. [2024-11-12 03:58:30,137 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 149 transitions. Word has length 173 [2024-11-12 03:58:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:30,140 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 149 transitions. [2024-11-12 03:58:30,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2024-11-12 03:58:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:58:30,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:30,145 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:58:30,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2112475435, now seen corresponding path program 1 times [2024-11-12 03:58:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455941775] [2024-11-12 03:58:30,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455941775] [2024-11-12 03:58:30,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455941775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:30,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:58:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107350938] [2024-11-12 03:58:30,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:30,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:58:30,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:58:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:58:30,543 INFO L87 Difference]: Start difference. First operand 96 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:30,608 INFO L93 Difference]: Finished difference Result 190 states and 297 transitions. [2024-11-12 03:58:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:58:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 03:58:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:30,611 INFO L225 Difference]: With dead ends: 190 [2024-11-12 03:58:30,611 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 03:58:30,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-12 03:58:30,613 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:30,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:58:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 03:58:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 03:58:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-11-12 03:58:30,629 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 174 [2024-11-12 03:58:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-11-12 03:58:30,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-11-12 03:58:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:58:30,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:30,636 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:58:30,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:30,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -137454800, now seen corresponding path program 1 times [2024-11-12 03:58:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021464866] [2024-11-12 03:58:30,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021464866] [2024-11-12 03:58:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021464866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:31,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:31,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:58:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632557958] [2024-11-12 03:58:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:31,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:58:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:58:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:31,217 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:31,346 INFO L93 Difference]: Finished difference Result 282 states and 429 transitions. [2024-11-12 03:58:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:58:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 03:58:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:31,349 INFO L225 Difference]: With dead ends: 282 [2024-11-12 03:58:31,349 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 03:58:31,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:31,356 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:31,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 347 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:58:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 03:58:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2024-11-12 03:58:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 120 states have internal predecessors, (174), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 03:58:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2024-11-12 03:58:31,383 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 175 [2024-11-12 03:58:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2024-11-12 03:58:31,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2024-11-12 03:58:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:58:31,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:31,391 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:31,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:58:31,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash -946801426, now seen corresponding path program 1 times [2024-11-12 03:58:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783264485] [2024-11-12 03:58:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783264485] [2024-11-12 03:58:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783264485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:58:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113535137] [2024-11-12 03:58:31,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:31,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:31,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:31,932 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-12 03:58:31,933 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-12 03:58:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:32,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:58:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 543 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 03:58:32,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:58:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113535137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:58:32,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:58:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-12 03:58:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744553465] [2024-11-12 03:58:32,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:58:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:58:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:58:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:58:32,714 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-12 03:58:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:33,080 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2024-11-12 03:58:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 03:58:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 175 [2024-11-12 03:58:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:33,085 INFO L225 Difference]: With dead ends: 327 [2024-11-12 03:58:33,085 INFO L226 Difference]: Without dead ends: 177 [2024-11-12 03:58:33,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-12 03:58:33,091 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 194 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:33,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 404 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:58:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-12 03:58:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2024-11-12 03:58:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 128 states have (on average 1.3828125) internal successors, (177), 130 states have internal predecessors, (177), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 03:58:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2024-11-12 03:58:33,112 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 175 [2024-11-12 03:58:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:33,112 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2024-11-12 03:58:33,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-12 03:58:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2024-11-12 03:58:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:58:33,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:33,115 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:33,134 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-12 03:58:33,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:33,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:33,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash -553774416, now seen corresponding path program 1 times [2024-11-12 03:58:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:33,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350661786] [2024-11-12 03:58:33,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350661786] [2024-11-12 03:58:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350661786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:58:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017852631] [2024-11-12 03:58:33,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:33,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:33,698 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-12 03:58:33,700 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-12 03:58:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:33,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:58:33,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-12 03:58:34,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:58:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017852631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:58:34,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:58:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 03:58:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407207766] [2024-11-12 03:58:34,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:58:34,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:58:34,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:58:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:58:34,405 INFO L87 Difference]: Start difference. First operand 171 states and 253 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-12 03:58:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:34,630 INFO L93 Difference]: Finished difference Result 306 states and 452 transitions. [2024-11-12 03:58:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:58:34,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 175 [2024-11-12 03:58:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:34,634 INFO L225 Difference]: With dead ends: 306 [2024-11-12 03:58:34,634 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 03:58:34,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:58:34,636 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:34,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 287 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:58:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 03:58:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-12 03:58:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 85 states have internal predecessors, (107), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 03:58:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2024-11-12 03:58:34,652 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 175 [2024-11-12 03:58:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:34,652 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2024-11-12 03:58:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-12 03:58:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2024-11-12 03:58:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 03:58:34,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:34,654 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:34,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 03:58:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 03:58:34,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -305202082, now seen corresponding path program 1 times [2024-11-12 03:58:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105319621] [2024-11-12 03:58:34,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105319621] [2024-11-12 03:58:35,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105319621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:58:35,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188160077] [2024-11-12 03:58:35,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:35,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:58:35,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:58:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:35,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:58:35,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 603 proven. 24 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-11-12 03:58:35,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:58:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188160077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:58:35,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:58:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 03:58:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040644340] [2024-11-12 03:58:35,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:58:35,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:58:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:58:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:58:35,626 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-12 03:58:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:35,870 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-12 03:58:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:58:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 176 [2024-11-12 03:58:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:35,872 INFO L225 Difference]: With dead ends: 229 [2024-11-12 03:58:35,872 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 03:58:35,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:58:35,873 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 150 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:35,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 220 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:58:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 03:58:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2024-11-12 03:58:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 03:58:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2024-11-12 03:58:35,889 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 176 [2024-11-12 03:58:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2024-11-12 03:58:35,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-12 03:58:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2024-11-12 03:58:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-12 03:58:35,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:35,892 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:35,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 03:58:36,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:36,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:36,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash -591981802, now seen corresponding path program 1 times [2024-11-12 03:58:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420361328] [2024-11-12 03:58:36,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:36,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420361328] [2024-11-12 03:58:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420361328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:58:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915606084] [2024-11-12 03:58:36,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:36,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:36,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:36,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:58:36,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:36,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:58:36,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-12 03:58:36,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:58:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:58:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915606084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:58:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:58:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 03:58:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65184380] [2024-11-12 03:58:36,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:58:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:58:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:58:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:58:36,799 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-12 03:58:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:37,013 INFO L93 Difference]: Finished difference Result 237 states and 323 transitions. [2024-11-12 03:58:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:58:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 177 [2024-11-12 03:58:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:37,017 INFO L225 Difference]: With dead ends: 237 [2024-11-12 03:58:37,017 INFO L226 Difference]: Without dead ends: 133 [2024-11-12 03:58:37,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:58:37,018 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 150 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 229 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:58:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-12 03:58:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-12 03:58:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 03:58:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-11-12 03:58:37,037 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 177 [2024-11-12 03:58:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:37,038 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-11-12 03:58:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-12 03:58:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-11-12 03:58:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-12 03:58:37,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:37,041 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:37,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 03:58:37,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:37,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:37,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1139772923, now seen corresponding path program 1 times [2024-11-12 03:58:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590117730] [2024-11-12 03:58:37,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:58:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843660982] [2024-11-12 03:58:37,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:37,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:37,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:37,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:58:37,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 03:58:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:37,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 03:58:37,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:38,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:58:38,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:38,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590117730] [2024-11-12 03:58:38,083 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:58:38,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843660982] [2024-11-12 03:58:38,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843660982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:38,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:38,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:58:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236175547] [2024-11-12 03:58:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:58:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:58:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:58:38,085 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:38,246 INFO L93 Difference]: Finished difference Result 336 states and 452 transitions. [2024-11-12 03:58:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:58:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-12 03:58:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:38,249 INFO L225 Difference]: With dead ends: 336 [2024-11-12 03:58:38,249 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 03:58:38,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:38,250 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 109 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 374 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:58:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 03:58:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 202. [2024-11-12 03:58:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.1884057971014492) internal successors, (164), 138 states have internal predecessors, (164), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:58:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 268 transitions. [2024-11-12 03:58:38,291 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 268 transitions. Word has length 178 [2024-11-12 03:58:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:38,291 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 268 transitions. [2024-11-12 03:58:38,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2024-11-12 03:58:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-12 03:58:38,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:38,295 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:38,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 03:58:38,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:38,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1618925255, now seen corresponding path program 1 times [2024-11-12 03:58:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303345255] [2024-11-12 03:58:38,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303345255] [2024-11-12 03:58:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303345255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:38,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:58:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914380064] [2024-11-12 03:58:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:38,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:58:38,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:38,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:58:38,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:58:38,703 INFO L87 Difference]: Start difference. First operand 202 states and 268 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:38,854 INFO L93 Difference]: Finished difference Result 414 states and 555 transitions. [2024-11-12 03:58:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:58:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2024-11-12 03:58:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:38,858 INFO L225 Difference]: With dead ends: 414 [2024-11-12 03:58:38,858 INFO L226 Difference]: Without dead ends: 306 [2024-11-12 03:58:38,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:38,860 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 192 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:38,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 236 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:58:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-12 03:58:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 202. [2024-11-12 03:58:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.1884057971014492) internal successors, (164), 138 states have internal predecessors, (164), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:58:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 268 transitions. [2024-11-12 03:58:38,900 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 268 transitions. Word has length 178 [2024-11-12 03:58:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:38,900 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 268 transitions. [2024-11-12 03:58:38,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2024-11-12 03:58:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-12 03:58:38,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:38,903 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:38,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 03:58:38,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:38,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1913852831, now seen corresponding path program 1 times [2024-11-12 03:58:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061712694] [2024-11-12 03:58:38,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061712694] [2024-11-12 03:58:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061712694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:58:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883349967] [2024-11-12 03:58:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:58:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:58:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:58:39,165 INFO L87 Difference]: Start difference. First operand 202 states and 268 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:39,314 INFO L93 Difference]: Finished difference Result 351 states and 468 transitions. [2024-11-12 03:58:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:58:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-11-12 03:58:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:39,317 INFO L225 Difference]: With dead ends: 351 [2024-11-12 03:58:39,317 INFO L226 Difference]: Without dead ends: 224 [2024-11-12 03:58:39,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:39,318 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 95 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:39,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 367 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:58:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-12 03:58:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2024-11-12 03:58:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 139 states have internal predecessors, (163), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:58:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 267 transitions. [2024-11-12 03:58:39,351 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 267 transitions. Word has length 179 [2024-11-12 03:58:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:39,353 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 267 transitions. [2024-11-12 03:58:39,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 267 transitions. [2024-11-12 03:58:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-12 03:58:39,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:39,355 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 03:58:39,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:39,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2125769096, now seen corresponding path program 1 times [2024-11-12 03:58:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920942724] [2024-11-12 03:58:39,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:58:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:58:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:58:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:58:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:58:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:58:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:58:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:58:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:58:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:58:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:58:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:58:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:58:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:58:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:58:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:58:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:58:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:58:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:58:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:58:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:58:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:58:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:58:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:58:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:58:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:58:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:58:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:58:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920942724] [2024-11-12 03:58:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920942724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:58:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599326331] [2024-11-12 03:58:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:39,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:58:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:58:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:58:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:58:39,518 INFO L87 Difference]: Start difference. First operand 203 states and 267 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:39,673 INFO L93 Difference]: Finished difference Result 415 states and 553 transitions. [2024-11-12 03:58:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:58:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-11-12 03:58:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:39,676 INFO L225 Difference]: With dead ends: 415 [2024-11-12 03:58:39,676 INFO L226 Difference]: Without dead ends: 307 [2024-11-12 03:58:39,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:58:39,677 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 182 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:58:39,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 234 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:58:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-12 03:58:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 199. [2024-11-12 03:58:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 135 states have (on average 1.162962962962963) internal successors, (157), 135 states have internal predecessors, (157), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:58:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 261 transitions. [2024-11-12 03:58:39,726 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 261 transitions. Word has length 179 [2024-11-12 03:58:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 261 transitions. [2024-11-12 03:58:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:58:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 261 transitions. [2024-11-12 03:58:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 03:58:39,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:39,728 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:39,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 03:58:39,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:39,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash -446142718, now seen corresponding path program 1 times [2024-11-12 03:58:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:58:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507382236] [2024-11-12 03:58:39,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:58:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:58:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497438977] [2024-11-12 03:58:39,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:39,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:58:39,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 03:58:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:58:39,996 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:58:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:58:40,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:58:40,214 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:58:40,216 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:58:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 03:58:40,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:58:40,422 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:40,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:58:40,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:58:40 BoogieIcfgContainer [2024-11-12 03:58:40,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:58:40,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:58:40,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:58:40,544 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:58:40,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:58:28" (3/4) ... [2024-11-12 03:58:40,547 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:58:40,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:58:40,549 INFO L158 Benchmark]: Toolchain (without parser) took 13259.17ms. Allocated memory was 151.0MB in the beginning and 308.3MB in the end (delta: 157.3MB). Free memory was 98.1MB in the beginning and 185.0MB in the end (delta: -86.8MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,549 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 115.8MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:58:40,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.32ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 79.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.40ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 76.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,550 INFO L158 Benchmark]: Boogie Preprocessor took 73.51ms. Allocated memory is still 151.0MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,550 INFO L158 Benchmark]: RCFGBuilder took 644.96ms. Allocated memory is still 151.0MB. Free memory was 72.0MB in the beginning and 45.4MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,551 INFO L158 Benchmark]: TraceAbstraction took 12042.04ms. Allocated memory was 151.0MB in the beginning and 308.3MB in the end (delta: 157.3MB). Free memory was 44.7MB in the beginning and 185.0MB in the end (delta: -140.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-12 03:58:40,551 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 308.3MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:58:40,552 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.20ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 115.8MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.32ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 79.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.40ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 76.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.51ms. Allocated memory is still 151.0MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 644.96ms. Allocated memory is still 151.0MB. Free memory was 72.0MB in the beginning and 45.4MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12042.04ms. Allocated memory was 151.0MB in the beginning and 308.3MB in the end (delta: 157.3MB). Free memory was 44.7MB in the beginning and 185.0MB in the end (delta: -140.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 308.3MB. Free memory is still 185.0MB. 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 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_37 = 3773873024; [L42] unsigned long int var_1_38 = 2296504360; [L43] unsigned long int var_1_39 = 16; [L44] unsigned long int var_1_40 = 2753961414; [L45] unsigned char var_1_41 = 8; [L46] signed short int var_1_43 = -50; [L47] signed char var_1_44 = -1; [L48] double var_1_47 = 255.2; [L49] double var_1_50 = 50.4; [L50] double var_1_51 = 49.25; [L51] double var_1_52 = 1000000.4; [L52] double var_1_53 = 256.2; [L53] signed char var_1_54 = -8; [L54] unsigned char last_1_var_1_17 = 1; [L55] double last_1_var_1_20 = 9.25; [L56] unsigned char last_1_var_1_23 = 2; [L57] unsigned short int last_1_var_1_26 = 5; [L58] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L191] last_1_var_1_17 = var_1_17 [L192] last_1_var_1_20 = var_1_20 [L193] last_1_var_1_23 = var_1_23 [L194] last_1_var_1_26 = var_1_26 [L195] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L147] var_1_11 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L148] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L150] var_1_14 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L151] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L152] var_1_16 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L153] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L155] var_1_18 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L156] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L162] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L164] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L165] var_1_25 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L168] var_1_27 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L169] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L171] var_1_28 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L172] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L174] var_1_37 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L175] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L177] var_1_38 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L178] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L180] var_1_40 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_40 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L181] RET assume_abort_if_not(var_1_40 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] CALL assume_abort_if_not(var_1_40 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] RET assume_abort_if_not(var_1_40 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L183] var_1_50 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L184] RET assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L185] var_1_51 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L186] RET assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L187] var_1_52 = __VERIFIER_nondet_double() [L188] CALL assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L188] RET assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L206] RET updateVariables() [L207] CALL step() [L62] COND TRUE var_1_18 && var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L63] COND TRUE var_1_26 <= var_1_29 [L64] var_1_32 = (((((var_1_37) < (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))))) ? (var_1_37) : (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38)))))) - var_1_26) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L67] COND TRUE (- var_1_38) <= (- var_1_37) [L68] var_1_39 = (2368197193u - var_1_23) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L76] var_1_41 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L77] COND FALSE !(var_1_37 <= ((((var_1_26) > (var_1_25)) ? (var_1_26) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] EXPR var_1_37 ^ var_1_40 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] EXPR ((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] COND TRUE var_1_25 <= ((((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)))) [L81] COND TRUE \read(var_1_17) [L82] var_1_44 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L87] COND TRUE var_1_17 || var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L88] COND TRUE var_1_11 >= var_1_11 [L89] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L102] var_1_53 = 5.5 [L103] var_1_54 = var_1_16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L104] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L107] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L108] COND FALSE !((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) [L111] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L117] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L118] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L120] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L121] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L124] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L125] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L126] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L133] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=2032, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L134] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L141] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=2032, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L143] var_1_31 = var_1_26 [L144] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=2032, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=16, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=16, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=16, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=0, var_1_11=0, var_1_16=-63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=127, var_1_25=127, var_1_26=16, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=16, var_1_32=-2147483654, var_1_37=-2147483649, var_1_38=-2147483649, var_1_39=2368197191, var_1_40=2147483647, var_1_41=127, var_1_43=-50, var_1_44=0, var_1_47=2, var_1_53=11/2, var_1_54=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1416 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1361 mSDsluCounter, 3377 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1867 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 1510 mSDtfsCounter, 976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2243 GetRequests, 2184 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=11, InterpolantAutomatonStates: 67, 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, 12 MinimizatonAttempts, 319 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3353 NumberOfCodeBlocks, 3353 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3498 ConstructedInterpolants, 0 QuantifiedInterpolants, 7686 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2142 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 25550/26000 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-12 03:58:40,589 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-ps-ci_file-72.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 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:58:42,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:58:42,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:58:42,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:58:42,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:58:42,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:58:42,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:58:42,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:58:42,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:58:42,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:58:42,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:58:42,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:58:42,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:58:42,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:58:42,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:58:42,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:58:42,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:58:42,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:58:42,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:58:42,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:58:42,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:58:42,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:58:42,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:58:42,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:58:42,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:58:42,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:58:42,932 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:58:42,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:58:42,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:58:42,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:58:42,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:58:42,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:58:42,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:58:42,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:58:42,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:58:42,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:58:42,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:58:42,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:58:42,940 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:58:42,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:58:42,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:58:42,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:58:42,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:58:42,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:58:42,942 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 -> 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 [2024-11-12 03:58:43,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:58:43,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:58:43,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:58:43,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:58:43,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:58:43,304 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-ps-ci_file-72.i [2024-11-12 03:58:44,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:58:45,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:58:45,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-12 03:58:45,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93df53c4/352d56fd54fc4576b029eacf1c546563/FLAG6b5d938b6 [2024-11-12 03:58:45,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93df53c4/352d56fd54fc4576b029eacf1c546563 [2024-11-12 03:58:45,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:58:45,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:58:45,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:58:45,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:58:45,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:58:45,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415f1910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45, skipping insertion in model container [2024-11-12 03:58:45,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:58:45,392 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-ps-ci_file-72.i[919,932] [2024-11-12 03:58:45,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:58:45,504 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:58:45,518 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-ps-ci_file-72.i[919,932] [2024-11-12 03:58:45,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:58:45,594 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:58:45,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45 WrapperNode [2024-11-12 03:58:45,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:58:45,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:58:45,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:58:45,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:58:45,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,661 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-12 03:58:45,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:58:45,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:58:45,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:58:45,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:58:45,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,720 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-12 03:58:45,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:58:45,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:58:45,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:58:45,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:58:45,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (1/1) ... [2024-11-12 03:58:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:58:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:58:45,792 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-12 03:58:45,795 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-12 03:58:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:58:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:58:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:58:45,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:58:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:58:45,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:58:45,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:58:45,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:58:52,402 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 03:58:52,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:58:52,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:58:52,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:58:52,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:58:52 BoogieIcfgContainer [2024-11-12 03:58:52,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:58:52,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:58:52,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:58:52,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:58:52,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:58:45" (1/3) ... [2024-11-12 03:58:52,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3fb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:58:52, skipping insertion in model container [2024-11-12 03:58:52,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:58:45" (2/3) ... [2024-11-12 03:58:52,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3fb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:58:52, skipping insertion in model container [2024-11-12 03:58:52,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:58:52" (3/3) ... [2024-11-12 03:58:52,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-12 03:58:52,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:58:52,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:58:52,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:58:52,510 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;@4846e6d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:58:52,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:58:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 03:58:52,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:52,526 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:52,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 115022112, now seen corresponding path program 1 times [2024-11-12 03:58:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:58:52,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801123369] [2024-11-12 03:58:52,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:52,555 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-12 03:58:52,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:58:52,559 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-12 03:58:52,576 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-12 03:58:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:53,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:58:53,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 03:58:53,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:58:53,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:58:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801123369] [2024-11-12 03:58:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801123369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:58:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:58:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:58:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463378059] [2024-11-12 03:58:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:58:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:58:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:58:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:58:53,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:58:53,164 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:58:53,191 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2024-11-12 03:58:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:58:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-12 03:58:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:58:53,202 INFO L225 Difference]: With dead ends: 165 [2024-11-12 03:58:53,202 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 03:58:53,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-12 03:58:53,209 INFO L435 NwaCegarLoop]: 124 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, 124 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-12 03:58:53,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:58:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 03:58:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 03:58:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:58:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-12 03:58:53,247 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 171 [2024-11-12 03:58:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:58:53,248 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-12 03:58:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:58:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-12 03:58:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 03:58:53,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:58:53,251 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:58:53,270 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-12 03:58:53,452 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-12 03:58:53,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:58:53,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:58:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1148896349, now seen corresponding path program 1 times [2024-11-12 03:58:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:58:53,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407243881] [2024-11-12 03:58:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:58:53,455 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-12 03:58:53,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:58:53,458 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-12 03:58:53,459 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-12 03:58:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:58:53,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:58:53,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:58:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 531 proven. 111 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-11-12 03:58:57,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:58:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-12 03:58:59,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:58:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407243881] [2024-11-12 03:58:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407243881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:58:59,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:58:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-12 03:58:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543492472] [2024-11-12 03:58:59,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:58:59,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 03:58:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:58:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 03:58:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:58:59,241 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-12 03:59:05,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:59:07,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:59:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:59:08,517 INFO L93 Difference]: Finished difference Result 184 states and 271 transitions. [2024-11-12 03:59:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 03:59:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 173 [2024-11-12 03:59:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:59:08,521 INFO L225 Difference]: With dead ends: 184 [2024-11-12 03:59:08,522 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 03:59:08,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-12 03:59:08,528 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:59:08,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 306 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2024-11-12 03:59:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 03:59:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-11-12 03:59:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 03:59:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-12 03:59:08,557 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 173 [2024-11-12 03:59:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:59:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-12 03:59:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-12 03:59:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-12 03:59:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:59:08,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:59:08,565 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:59:08,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:59:08,767 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-12 03:59:08,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:59:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:59:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash -668606329, now seen corresponding path program 1 times [2024-11-12 03:59:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:59:08,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599029979] [2024-11-12 03:59:08,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:59:08,770 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-12 03:59:08,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:59:08,771 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-12 03:59:08,772 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-12 03:59:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:59:09,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:59:09,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:59:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:59:10,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:59:10,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:59:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599029979] [2024-11-12 03:59:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599029979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:59:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:59:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:59:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122850591] [2024-11-12 03:59:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:59:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:59:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:59:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:59:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:59:10,901 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:15,090 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-12 03:59:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:59:15,188 INFO L93 Difference]: Finished difference Result 245 states and 347 transitions. [2024-11-12 03:59:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:59:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 03:59:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:59:15,192 INFO L225 Difference]: With dead ends: 245 [2024-11-12 03:59:15,192 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 03:59:15,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 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-12 03:59:15,194 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:59:15,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 217 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-12 03:59:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 03:59:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2024-11-12 03:59:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:59:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2024-11-12 03:59:15,222 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 174 [2024-11-12 03:59:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:59:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2024-11-12 03:59:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2024-11-12 03:59:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:59:15,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:59:15,226 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:59:15,248 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 (4)] Ended with exit code 0 [2024-11-12 03:59:15,427 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-12 03:59:15,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:59:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:59:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 919741573, now seen corresponding path program 1 times [2024-11-12 03:59:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:59:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685565009] [2024-11-12 03:59:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:59:15,429 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-12 03:59:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:59:15,432 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-12 03:59:15,434 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-12 03:59:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:59:15,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:59:15,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:59:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:59:19,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:59:19,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:59:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685565009] [2024-11-12 03:59:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685565009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:59:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:59:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:59:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348941094] [2024-11-12 03:59:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:59:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:59:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:59:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:59:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:59:19,805 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:24,247 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-12 03:59:27,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:59:31,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:59:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:59:31,800 INFO L93 Difference]: Finished difference Result 267 states and 373 transitions. [2024-11-12 03:59:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:59:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 03:59:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:59:31,850 INFO L225 Difference]: With dead ends: 267 [2024-11-12 03:59:31,850 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 03:59:31,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:59:31,852 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 92 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:59:31,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 320 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2024-11-12 03:59:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 03:59:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2024-11-12 03:59:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 97 states have internal predecessors, (113), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:59:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 217 transitions. [2024-11-12 03:59:31,884 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 217 transitions. Word has length 174 [2024-11-12 03:59:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:59:31,887 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 217 transitions. [2024-11-12 03:59:31,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 217 transitions. [2024-11-12 03:59:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:59:31,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:59:31,894 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:59:31,916 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 03:59:32,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 03:59:32,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:59:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:59:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash -789323674, now seen corresponding path program 1 times [2024-11-12 03:59:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:59:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541944615] [2024-11-12 03:59:32,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:59:32,096 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-12 03:59:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:59:32,097 INFO L229 MonitoredProcess]: Starting monitored process 6 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-12 03:59:32,098 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 (6)] Waiting until timeout for monitored process [2024-11-12 03:59:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:59:32,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 03:59:32,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:59:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:59:34,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:59:34,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:59:34,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541944615] [2024-11-12 03:59:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541944615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:59:34,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:59:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:59:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116536480] [2024-11-12 03:59:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:59:34,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:59:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:59:34,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:59:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:59:34,380 INFO L87 Difference]: Start difference. First operand 156 states and 217 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:38,753 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-12 03:59:42,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:59:46,279 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-12 03:59:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:59:46,280 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2024-11-12 03:59:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:59:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 03:59:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:59:46,328 INFO L225 Difference]: With dead ends: 259 [2024-11-12 03:59:46,328 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 03:59:46,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:59:46,330 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:59:46,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2024-11-12 03:59:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 03:59:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2024-11-12 03:59:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.163265306122449) internal successors, (114), 98 states have internal predecessors, (114), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:59:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2024-11-12 03:59:46,366 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 175 [2024-11-12 03:59:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:59:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2024-11-12 03:59:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:59:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2024-11-12 03:59:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 03:59:46,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:59:46,370 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:59:46,395 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 03:59:46,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-12 03:59:46,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:59:46,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:59:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash -3104790, now seen corresponding path program 1 times [2024-11-12 03:59:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:59:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114999873] [2024-11-12 03:59:46,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:59:46,573 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-12 03:59:46,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:59:46,576 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12 03:59:46,577 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 (7)] Waiting until timeout for monitored process [2024-11-12 03:59:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:59:47,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:59:47,032 INFO L279 TraceCheckSpWp]: Computing forward predicates...