./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:52:25,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:52:25,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:52:25,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:52:25,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:52:25,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:52:25,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:52:25,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:52:25,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:52:25,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:52:25,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:52:25,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:52:25,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:52:25,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:52:25,216 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:52:25,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:52:25,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:52:25,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:52:25,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:52:25,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:52:25,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:52:25,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:52:25,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:52:25,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:52:25,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:52:25,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:52:25,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:52:25,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:52:25,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:52:25,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:52:25,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:52:25,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:52:25,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:25,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:52:25,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:52:25,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:52:25,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:52:25,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:52:25,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:52:25,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:52:25,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:52:25,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:52:25,225 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-clean/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-clean/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 -> 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 [2024-10-11 08:52:25,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:52:25,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:52:25,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:52:25,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:52:25,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:52:25,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:26,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:26,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:26,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:26,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd669f54c/28a9db76fa104f548cd0677e6d62a902/FLAG433f8f3fc [2024-10-11 08:52:27,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd669f54c/28a9db76fa104f548cd0677e6d62a902 [2024-10-11 08:52:27,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:27,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:27,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:27,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:27,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:27,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d31519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27, skipping insertion in model container [2024-10-11 08:52:27,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:27,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-10-11 08:52:27,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:27,539 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:27,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-10-11 08:52:27,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:27,603 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:27,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27 WrapperNode [2024-10-11 08:52:27,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:27,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:27,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:27,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:27,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,651 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-11 08:52:27,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:27,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:27,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:27,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:27,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,693 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:52:27,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:27,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:27,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:27,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:27,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (1/1) ... [2024-10-11 08:52:27,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:27,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:27,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:52:27,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:52:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:27,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:52:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:27,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:27,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:27,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:28,196 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:28,197 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:28,226 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:28,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:28,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:28 BoogieIcfgContainer [2024-10-11 08:52:28,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:28,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:28,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:28,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:28,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:27" (1/3) ... [2024-10-11 08:52:28,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4917ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:28, skipping insertion in model container [2024-10-11 08:52:28,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:27" (2/3) ... [2024-10-11 08:52:28,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4917ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:28, skipping insertion in model container [2024-10-11 08:52:28,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:28" (3/3) ... [2024-10-11 08:52:28,236 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:28,248 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:28,249 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:28,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:28,305 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;@5ef5d411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:28,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 08:52:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 08:52:28,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:28,324 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:28,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:28,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1296462302, now seen corresponding path program 1 times [2024-10-11 08:52:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432755280] [2024-10-11 08:52:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432755280] [2024-10-11 08:52:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432755280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:52:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101626677] [2024-10-11 08:52:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:28,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:52:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:52:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:28,754 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:52:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:28,794 INFO L93 Difference]: Finished difference Result 151 states and 264 transitions. [2024-10-11 08:52:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:52:28,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-10-11 08:52:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:28,802 INFO L225 Difference]: With dead ends: 151 [2024-10-11 08:52:28,804 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 08:52:28,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:28,811 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:28,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 08:52:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 08:52:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 08:52:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2024-10-11 08:52:28,849 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 136 [2024-10-11 08:52:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2024-10-11 08:52:28,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:52:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2024-10-11 08:52:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 08:52:28,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:28,852 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:52:28,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1467169834, now seen corresponding path program 1 times [2024-10-11 08:52:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541616013] [2024-10-11 08:52:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:29,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541616013] [2024-10-11 08:52:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541616013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:52:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793669060] [2024-10-11 08:52:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:52:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:52:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:29,095 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:29,161 INFO L93 Difference]: Finished difference Result 195 states and 300 transitions. [2024-10-11 08:52:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:52:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-11 08:52:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:29,165 INFO L225 Difference]: With dead ends: 195 [2024-10-11 08:52:29,165 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 08:52:29,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:29,168 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 59 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:29,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 262 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 08:52:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-10-11 08:52:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:52:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-10-11 08:52:29,184 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 136 [2024-10-11 08:52:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:29,185 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-10-11 08:52:29,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-10-11 08:52:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 08:52:29,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:29,187 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:52:29,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2010149012, now seen corresponding path program 1 times [2024-10-11 08:52:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926422624] [2024-10-11 08:52:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926422624] [2024-10-11 08:52:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926422624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:52:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465881407] [2024-10-11 08:52:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:52:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:52:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:52:29,852 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:30,187 INFO L93 Difference]: Finished difference Result 342 states and 527 transitions. [2024-10-11 08:52:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:52:30,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-11 08:52:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:30,190 INFO L225 Difference]: With dead ends: 342 [2024-10-11 08:52:30,190 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 08:52:30,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:52:30,195 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:30,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 431 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 08:52:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 157. [2024-10-11 08:52:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 108 states have internal predecessors, (148), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 08:52:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2024-10-11 08:52:30,234 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 136 [2024-10-11 08:52:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:30,235 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2024-10-11 08:52:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2024-10-11 08:52:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 08:52:30,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:30,239 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:52:30,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -445900267, now seen corresponding path program 1 times [2024-10-11 08:52:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266709742] [2024-10-11 08:52:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266709742] [2024-10-11 08:52:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266709742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064130500] [2024-10-11 08:52:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:30,438 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:30,590 INFO L93 Difference]: Finished difference Result 449 states and 689 transitions. [2024-10-11 08:52:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:52:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-11 08:52:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:30,594 INFO L225 Difference]: With dead ends: 449 [2024-10-11 08:52:30,595 INFO L226 Difference]: Without dead ends: 332 [2024-10-11 08:52:30,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:30,600 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 104 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:30,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 257 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:52:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-11 08:52:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 310. [2024-10-11 08:52:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 232 states have (on average 1.4353448275862069) internal successors, (333), 234 states have internal predecessors, (333), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:52:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2024-10-11 08:52:30,646 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 137 [2024-10-11 08:52:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:30,647 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2024-10-11 08:52:30,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2024-10-11 08:52:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 08:52:30,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:30,652 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:30,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:52:30,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:30,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash -17307583, now seen corresponding path program 1 times [2024-10-11 08:52:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261461930] [2024-10-11 08:52:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261461930] [2024-10-11 08:52:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261461930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:52:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028689966] [2024-10-11 08:52:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:52:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:52:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:30,843 INFO L87 Difference]: Start difference. First operand 310 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:31,025 INFO L93 Difference]: Finished difference Result 716 states and 1105 transitions. [2024-10-11 08:52:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:52:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-10-11 08:52:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:31,029 INFO L225 Difference]: With dead ends: 716 [2024-10-11 08:52:31,029 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 08:52:31,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:52:31,032 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 179 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:31,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 167 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 08:52:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 320. [2024-10-11 08:52:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 242 states have (on average 1.4256198347107438) internal successors, (345), 244 states have internal predecessors, (345), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:52:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 489 transitions. [2024-10-11 08:52:31,060 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 489 transitions. Word has length 138 [2024-10-11 08:52:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:31,060 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 489 transitions. [2024-10-11 08:52:31,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 489 transitions. [2024-10-11 08:52:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 08:52:31,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:31,062 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:31,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:52:31,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1706251325, now seen corresponding path program 1 times [2024-10-11 08:52:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835733026] [2024-10-11 08:52:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835733026] [2024-10-11 08:52:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835733026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:52:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99366429] [2024-10-11 08:52:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:52:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:52:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:52:31,318 INFO L87 Difference]: Start difference. First operand 320 states and 489 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:31,577 INFO L93 Difference]: Finished difference Result 1066 states and 1632 transitions. [2024-10-11 08:52:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:52:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-10-11 08:52:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:31,581 INFO L225 Difference]: With dead ends: 1066 [2024-10-11 08:52:31,581 INFO L226 Difference]: Without dead ends: 786 [2024-10-11 08:52:31,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:52:31,582 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 377 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:31,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 360 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-11 08:52:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 384. [2024-10-11 08:52:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 306 states have (on average 1.4509803921568627) internal successors, (444), 308 states have internal predecessors, (444), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:52:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 588 transitions. [2024-10-11 08:52:31,613 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 588 transitions. Word has length 138 [2024-10-11 08:52:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:31,614 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 588 transitions. [2024-10-11 08:52:31,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 588 transitions. [2024-10-11 08:52:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 08:52:31,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:31,617 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:31,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:52:31,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 68756037, now seen corresponding path program 1 times [2024-10-11 08:52:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082622999] [2024-10-11 08:52:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 08:52:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082622999] [2024-10-11 08:52:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082622999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:52:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659959172] [2024-10-11 08:52:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:32,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:32,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:32,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:52:32,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:52:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 08:52:32,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-11 08:52:32,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 08:52:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659959172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:33,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:52:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 25 [2024-10-11 08:52:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201775054] [2024-10-11 08:52:33,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 08:52:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 08:52:33,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-10-11 08:52:33,384 INFO L87 Difference]: Start difference. First operand 384 states and 588 transitions. Second operand has 25 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 8 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-11 08:52:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:35,307 INFO L93 Difference]: Finished difference Result 713 states and 1028 transitions. [2024-10-11 08:52:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 08:52:35,308 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 8 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) Word has length 138 [2024-10-11 08:52:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:35,310 INFO L225 Difference]: With dead ends: 713 [2024-10-11 08:52:35,311 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 08:52:35,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1226, Invalid=3196, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 08:52:35,313 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 451 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:35,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 860 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 08:52:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 08:52:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 524. [2024-10-11 08:52:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 412 states have (on average 1.3907766990291262) internal successors, (573), 416 states have internal predecessors, (573), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 08:52:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 749 transitions. [2024-10-11 08:52:35,365 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 749 transitions. Word has length 138 [2024-10-11 08:52:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 749 transitions. [2024-10-11 08:52:35,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 8 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-11 08:52:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 749 transitions. [2024-10-11 08:52:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 08:52:35,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:35,367 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:35,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:52:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:35,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1367315847, now seen corresponding path program 1 times [2024-10-11 08:52:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177836324] [2024-10-11 08:52:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:52:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 08:52:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:35,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177836324] [2024-10-11 08:52:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177836324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:52:35,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127234382] [2024-10-11 08:52:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:35,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:35,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:52:35,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:52:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:36,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 08:52:36,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 417 proven. 78 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 08:52:36,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 08:52:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127234382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:36,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:52:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 08:52:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144883014] [2024-10-11 08:52:36,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 08:52:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 08:52:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-10-11 08:52:36,862 INFO L87 Difference]: Start difference. First operand 524 states and 749 transitions. Second operand has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-10-11 08:52:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:37,805 INFO L93 Difference]: Finished difference Result 1524 states and 2176 transitions. [2024-10-11 08:52:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 08:52:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) Word has length 139 [2024-10-11 08:52:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:37,810 INFO L225 Difference]: With dead ends: 1524 [2024-10-11 08:52:37,810 INFO L226 Difference]: Without dead ends: 1112 [2024-10-11 08:52:37,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=495, Invalid=1485, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 08:52:37,812 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 840 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:37,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 349 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 08:52:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-10-11 08:52:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 458. [2024-10-11 08:52:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 359 states have (on average 1.3119777158774373) internal successors, (471), 361 states have internal predecessors, (471), 72 states have call successors, (72), 26 states have call predecessors, (72), 26 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:52:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 615 transitions. [2024-10-11 08:52:37,860 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 615 transitions. Word has length 139 [2024-10-11 08:52:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:37,860 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 615 transitions. [2024-10-11 08:52:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-10-11 08:52:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 615 transitions. [2024-10-11 08:52:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 08:52:37,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:37,862 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:37,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:52:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:38,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:38,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1304870198, now seen corresponding path program 1 times [2024-10-11 08:52:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412931303] [2024-10-11 08:52:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:52:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913882140] [2024-10-11 08:52:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:38,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:38,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:38,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:52:38,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:52:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:38,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 08:52:38,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 391 proven. 123 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-11 08:52:38,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412931303] [2024-10-11 08:52:39,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:52:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913882140] [2024-10-11 08:52:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913882140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:52:39,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:52:39,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 08:52:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863662328] [2024-10-11 08:52:39,150 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:39,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 08:52:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 08:52:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:52:39,151 INFO L87 Difference]: Start difference. First operand 458 states and 615 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 08:52:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:39,384 INFO L93 Difference]: Finished difference Result 836 states and 1102 transitions. [2024-10-11 08:52:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 08:52:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 140 [2024-10-11 08:52:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:39,387 INFO L225 Difference]: With dead ends: 836 [2024-10-11 08:52:39,388 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 08:52:39,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 08:52:39,389 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 94 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:39,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 203 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 08:52:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 482. [2024-10-11 08:52:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 377 states have (on average 1.2705570291777188) internal successors, (479), 379 states have internal predecessors, (479), 72 states have call successors, (72), 32 states have call predecessors, (72), 32 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 08:52:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 623 transitions. [2024-10-11 08:52:39,429 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 623 transitions. Word has length 140 [2024-10-11 08:52:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:39,431 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 623 transitions. [2024-10-11 08:52:39,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 08:52:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 623 transitions. [2024-10-11 08:52:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 08:52:39,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:39,432 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:39,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 08:52:39,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:39,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 444544978, now seen corresponding path program 1 times [2024-10-11 08:52:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898568447] [2024-10-11 08:52:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:52:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041800086] [2024-10-11 08:52:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:39,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:52:39,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 08:52:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:39,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:52:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:39,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:52:39,991 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:52:39,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:52:40,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 08:52:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 08:52:40,197 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:40,315 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:52:40,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:52:40 BoogieIcfgContainer [2024-10-11 08:52:40,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:52:40,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:52:40,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:52:40,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:52:40,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:28" (3/4) ... [2024-10-11 08:52:40,320 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:52:40,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:52:40,322 INFO L158 Benchmark]: Toolchain (without parser) took 13064.32ms. Allocated memory was 144.7MB in the beginning and 281.0MB in the end (delta: 136.3MB). Free memory was 75.2MB in the beginning and 91.3MB in the end (delta: -16.0MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,322 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:52:40,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.93ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 106.0MB in the end (delta: -31.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.98ms. Allocated memory is still 144.7MB. Free memory was 106.0MB in the beginning and 101.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,322 INFO L158 Benchmark]: Boogie Preprocessor took 66.13ms. Allocated memory is still 144.7MB. Free memory was 101.4MB in the beginning and 94.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,322 INFO L158 Benchmark]: RCFGBuilder took 508.11ms. Allocated memory is still 144.7MB. Free memory was 94.5MB in the beginning and 62.0MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,323 INFO L158 Benchmark]: TraceAbstraction took 12088.59ms. Allocated memory was 144.7MB in the beginning and 281.0MB in the end (delta: 136.3MB). Free memory was 61.0MB in the beginning and 92.3MB in the end (delta: -31.3MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,323 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 281.0MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:52:40,324 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.14ms. Allocated memory is still 144.7MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.93ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 106.0MB in the end (delta: -31.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.98ms. Allocated memory is still 144.7MB. Free memory was 106.0MB in the beginning and 101.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.13ms. Allocated memory is still 144.7MB. Free memory was 101.4MB in the beginning and 94.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 508.11ms. Allocated memory is still 144.7MB. Free memory was 94.5MB in the beginning and 62.0MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12088.59ms. Allocated memory was 144.7MB in the beginning and 281.0MB in the end (delta: 136.3MB). Free memory was 61.0MB in the beginning and 92.3MB in the end (delta: -31.3MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 281.0MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of shiftRight at line 165, overapproximation of someUnaryDOUBLEoperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] unsigned char var_1_27 = 4; [L44] signed short int var_1_35 = -64; [L45] signed char var_1_36 = -10; [L46] signed long int var_1_39 = 256; [L47] double var_1_40 = 31.6; [L48] signed short int var_1_42 = 5; [L49] signed short int last_1_var_1_21 = -64; [L50] unsigned char last_1_var_1_22 = 25; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L161] last_1_var_1_21 = var_1_21 [L162] last_1_var_1_22 = var_1_22 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] var_1_9 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L154] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L156] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L173] RET updateVariables() [L174] CALL step() [L54] signed long int stepLocal_1 = ~ last_1_var_1_21; [L55] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L57] COND TRUE stepLocal_0 || var_1_6 [L58] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L68] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] COND FALSE !(var_1_4 > stepLocal_3) [L72] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L74] COND TRUE ((- var_1_11) < 8) || var_1_9 [L75] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L77] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND TRUE var_1_18 <= var_1_20 [L79] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L85] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L90] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=-129, var_1_11=-385, var_1_12=-10, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND TRUE var_1_10 > stepLocal_2 [L92] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L94] var_1_25 = var_1_19 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L95] COND FALSE !((var_1_20 >= var_1_18) && (var_1_11 >= var_1_22)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] COND FALSE !(var_1_20 > var_1_18) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] COND TRUE var_1_11 >= (var_1_11 % ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] COND FALSE !(var_1_11 < var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] COND FALSE !(var_1_1 > var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] COND FALSE !(var_1_21 < ((((var_1_4) < (-64)) ? (var_1_4) : (-64)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] EXPR var_1_11 | var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] COND TRUE (var_1_11 | var_1_4) < (8 + var_1_11) [L121] var_1_40 = (((((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) < 0 ) ? -((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) : ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L124] var_1_42 = var_1_22 [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L165-L166] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-385, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2210 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2200 mSDsluCounter, 3001 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2112 mSDsCounter, 565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 565 mSolverCounterUnsat, 889 mSDtfsCounter, 3188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1239 GetRequests, 1093 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=7, InterpolantAutomatonStates: 121, 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, 9 MinimizatonAttempts, 1352 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 9721 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1017 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 9484/9880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:52:40,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:52:42,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:52:42,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:52:42,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:52:42,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:52:42,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:52:42,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:52:42,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:52:42,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:52:42,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:52:42,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:52:42,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:52:42,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:52:42,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:52:42,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:52:42,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:52:42,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:52:42,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:52:42,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:52:42,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:52:42,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:52:42,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:52:42,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:52:42,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:52:42,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:52:42,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:52:42,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:52:42,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:52:42,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:52:42,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:52:42,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:52:42,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:52:42,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:52:42,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:52:42,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:42,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:52:42,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:52:42,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:52:42,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:52:42,314 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:52:42,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:52:42,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:52:42,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:52:42,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:52:42,316 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:52:42,316 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-clean/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-clean/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 -> 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 [2024-10-11 08:52:42,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:52:42,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:52:42,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:52:42,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:52:42,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:52:42,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:43,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:44,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:44,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:44,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3486a58f2/7a3935c790ec443885ff398efa9165f8/FLAG0a30d0240 [2024-10-11 08:52:44,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3486a58f2/7a3935c790ec443885ff398efa9165f8 [2024-10-11 08:52:44,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:44,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:44,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:44,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:44,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:44,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ada0db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44, skipping insertion in model container [2024-10-11 08:52:44,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:44,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-10-11 08:52:44,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:44,743 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:44,755 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-10-11 08:52:44,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:44,820 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:44,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44 WrapperNode [2024-10-11 08:52:44,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:44,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:44,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:44,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:44,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,890 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-11 08:52:44,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:44,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:44,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:44,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:44,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:52:44,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:44,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:44,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:44,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:44,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (1/1) ... [2024-10-11 08:52:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:44,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:52:44,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:52:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:52:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:45,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:45,108 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:45,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:48,474 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:48,474 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:48,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:48,523 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:48,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:48 BoogieIcfgContainer [2024-10-11 08:52:48,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:48,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:48,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:48,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:48,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:44" (1/3) ... [2024-10-11 08:52:48,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8a045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:48, skipping insertion in model container [2024-10-11 08:52:48,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:44" (2/3) ... [2024-10-11 08:52:48,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8a045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:48, skipping insertion in model container [2024-10-11 08:52:48,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:48" (3/3) ... [2024-10-11 08:52:48,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-10-11 08:52:48,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:48,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:48,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:48,624 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;@109af54b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:48,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 08:52:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 08:52:48,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:48,640 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:48,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:48,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1194168494, now seen corresponding path program 1 times [2024-10-11 08:52:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608201113] [2024-10-11 08:52:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:48,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:48,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:52:48,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:52:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:48,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:52:48,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-11 08:52:49,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:49,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608201113] [2024-10-11 08:52:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608201113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:49,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:52:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574583796] [2024-10-11 08:52:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:52:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:52:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:49,059 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:52:51,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:52:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:51,079 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-11 08:52:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:52:51,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-10-11 08:52:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:51,109 INFO L225 Difference]: With dead ends: 135 [2024-10-11 08:52:51,110 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 08:52:51,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:51,116 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:51,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 08:52:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 08:52:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 08:52:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 08:52:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-11 08:52:51,148 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 133 [2024-10-11 08:52:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:51,148 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-11 08:52:51,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:52:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-11 08:52:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 08:52:51,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:51,151 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:51,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:52:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:51,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash 128163341, now seen corresponding path program 1 times [2024-10-11 08:52:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803462449] [2024-10-11 08:52:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:51,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:51,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:51,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:52:51,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:52:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:51,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:52:51,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:52:52,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:52,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803462449] [2024-10-11 08:52:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803462449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563286851] [2024-10-11 08:52:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:52,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:52:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:52:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:52,903 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:55,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:52:58,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:52:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:58,084 INFO L93 Difference]: Finished difference Result 200 states and 308 transitions. [2024-10-11 08:52:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:52:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-10-11 08:52:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:58,108 INFO L225 Difference]: With dead ends: 200 [2024-10-11 08:52:58,109 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 08:52:58,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:52:58,110 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:58,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 341 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 08:52:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 08:52:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2024-10-11 08:52:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:52:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 160 transitions. [2024-10-11 08:52:58,138 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 160 transitions. Word has length 134 [2024-10-11 08:52:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:58,139 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 160 transitions. [2024-10-11 08:52:58,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:52:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2024-10-11 08:52:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 08:52:58,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:58,140 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:58,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:52:58,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:58,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1008810677, now seen corresponding path program 1 times [2024-10-11 08:52:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584193553] [2024-10-11 08:52:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:58,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:52:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:52:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:58,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:52:58,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:52:59,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 08:52:59,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:59,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584193553] [2024-10-11 08:52:59,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584193553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:59,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:52:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 08:52:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065933390] [2024-10-11 08:52:59,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:59,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:52:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:52:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:52:59,554 INFO L87 Difference]: Start difference. First operand 105 states and 160 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:53:03,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:05,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:07,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:09,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:10,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:53:10,407 INFO L93 Difference]: Finished difference Result 219 states and 325 transitions. [2024-10-11 08:53:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:53:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 135 [2024-10-11 08:53:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:53:10,410 INFO L225 Difference]: With dead ends: 219 [2024-10-11 08:53:10,410 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 08:53:10,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:53:10,412 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 193 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:53:10,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 170 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-10-11 08:53:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 08:53:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2024-10-11 08:53:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 08:53:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2024-10-11 08:53:10,431 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 135 [2024-10-11 08:53:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:53:10,432 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2024-10-11 08:53:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 08:53:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2024-10-11 08:53:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 08:53:10,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:53:10,437 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:53:10,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:53:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:10,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:53:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:53:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1006963635, now seen corresponding path program 1 times [2024-10-11 08:53:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:53:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459269378] [2024-10-11 08:53:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:53:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:53:10,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:53:10,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:53:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:10,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:53:10,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:53:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:53:11,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:53:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:53:12,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:53:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459269378] [2024-10-11 08:53:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459269378] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 08:53:12,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:53:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 08:53:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108540415] [2024-10-11 08:53:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:53:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:53:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:53:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:53:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:53:12,606 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:53:13,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:16,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:53:16,350 INFO L93 Difference]: Finished difference Result 319 states and 478 transitions. [2024-10-11 08:53:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:53:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 135 [2024-10-11 08:53:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:53:16,354 INFO L225 Difference]: With dead ends: 319 [2024-10-11 08:53:16,354 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 08:53:16,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:53:16,355 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:53:16,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 271 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 08:53:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 08:53:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2024-10-11 08:53:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 154 states have internal predecessors, (213), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:53:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 333 transitions. [2024-10-11 08:53:16,379 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 333 transitions. Word has length 135 [2024-10-11 08:53:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:53:16,380 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 333 transitions. [2024-10-11 08:53:16,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 08:53:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 333 transitions. [2024-10-11 08:53:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 08:53:16,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:53:16,382 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:53:16,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 08:53:16,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:16,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:53:16,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:53:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1151571424, now seen corresponding path program 1 times [2024-10-11 08:53:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:53:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100582879] [2024-10-11 08:53:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:53:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:53:16,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:53:16,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:53:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:16,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:53:16,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:53:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 08:53:17,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:53:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 08:53:17,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:53:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100582879] [2024-10-11 08:53:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100582879] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 08:53:17,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:53:17,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 08:53:17,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745089436] [2024-10-11 08:53:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:53:17,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:53:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:53:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:53:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:53:17,650 INFO L87 Difference]: Start difference. First operand 221 states and 333 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:53:20,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:23,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:53:23,372 INFO L93 Difference]: Finished difference Result 413 states and 623 transitions. [2024-10-11 08:53:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:53:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-11 08:53:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:53:23,374 INFO L225 Difference]: With dead ends: 413 [2024-10-11 08:53:23,374 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 08:53:23,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:53:23,376 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:53:23,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 230 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 08:53:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 08:53:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2024-10-11 08:53:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 154 states have (on average 1.37012987012987) internal successors, (211), 154 states have internal predecessors, (211), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:53:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 331 transitions. [2024-10-11 08:53:23,411 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 331 transitions. Word has length 136 [2024-10-11 08:53:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:53:23,412 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 331 transitions. [2024-10-11 08:53:23,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 08:53:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 331 transitions. [2024-10-11 08:53:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 08:53:23,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:53:23,415 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:53:23,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 08:53:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:23,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:53:23,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:53:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1149251166, now seen corresponding path program 1 times [2024-10-11 08:53:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:53:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390205963] [2024-10-11 08:53:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:53:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:53:23,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:53:23,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:53:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:23,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 08:53:23,933 INFO L278 TraceCheckSpWp]: Computing forward predicates...