./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:08:07,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:08:07,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:08:07,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:08:07,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:08:07,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:08:07,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:08:07,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:08:07,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:08:07,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:08:07,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:08:07,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:08:07,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:08:07,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:08:07,464 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:08:07,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:08:07,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:08:07,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:08:07,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:07,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:08:07,466 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2025-03-03 21:08:07,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:08:07,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:08:07,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:08:07,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:08:07,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:08:07,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:08,875 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9efbe71a/5d94830a2d73436abb1fe2092169e27e/FLAGa500fe88e [2025-03-03 21:08:09,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:08:09,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:09,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9efbe71a/5d94830a2d73436abb1fe2092169e27e/FLAGa500fe88e [2025-03-03 21:08:09,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9efbe71a/5d94830a2d73436abb1fe2092169e27e [2025-03-03 21:08:09,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:08:09,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:08:09,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:09,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:08:09,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:08:09,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65830e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09, skipping insertion in model container [2025-03-03 21:08:09,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:08:09,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2025-03-03 21:08:09,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:09,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:08:09,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2025-03-03 21:08:09,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:09,721 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:08:09,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09 WrapperNode [2025-03-03 21:08:09,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:09,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:09,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:08:09,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:08:09,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,781 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-03-03 21:08:09,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:09,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:08:09,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:08:09,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:08:09,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,821 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]. [2025-03-03 21:08:09,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:08:09,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:08:09,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:08:09,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:08:09,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (1/1) ... [2025-03-03 21:08:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:09,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:08:09,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:08:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:08:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:08:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:08:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:08:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:08:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:08:09,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:08:09,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:08:10,268 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 21:08:10,304 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 21:08:10,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:08:10,324 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:08:10,324 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:08:10,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:10 BoogieIcfgContainer [2025-03-03 21:08:10,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:08:10,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:08:10,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:08:10,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:08:10,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:08:09" (1/3) ... [2025-03-03 21:08:10,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1291a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:10, skipping insertion in model container [2025-03-03 21:08:10,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:09" (2/3) ... [2025-03-03 21:08:10,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1291a95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:10, skipping insertion in model container [2025-03-03 21:08:10,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:10" (3/3) ... [2025-03-03 21:08:10,334 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:10,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:08:10,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:08:10,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:08:10,398 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;@5fc292a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:08:10,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:08:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:08:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:10,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:10,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:10,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -177064314, now seen corresponding path program 1 times [2025-03-03 21:08:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981344660] [2025-03-03 21:08:10,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:10,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:10,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:10,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 21:08:10,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981344660] [2025-03-03 21:08:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981344660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:08:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942938697] [2025-03-03 21:08:10,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:10,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:10,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:10,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:10,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:08:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:10,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:10,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:10,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:08:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 21:08:10,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942938697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:10,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:08:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:08:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680170237] [2025-03-03 21:08:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:10,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:08:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:10,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:08:10,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:10,869 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:08:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:10,899 INFO L93 Difference]: Finished difference Result 167 states and 286 transitions. [2025-03-03 21:08:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:08:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2025-03-03 21:08:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:10,908 INFO L225 Difference]: With dead ends: 167 [2025-03-03 21:08:10,909 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 21:08:10,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:10,915 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:10,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 21:08:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 21:08:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:08:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-03-03 21:08:10,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 137 [2025-03-03 21:08:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:10,957 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-03-03 21:08:10,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:08:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-03-03 21:08:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:10,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:10,963 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:08:11,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:08:11,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:11,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1644452727, now seen corresponding path program 1 times [2025-03-03 21:08:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:11,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587778337] [2025-03-03 21:08:11,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:11,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:11,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:11,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:11,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587778337] [2025-03-03 21:08:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587778337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970355777] [2025-03-03 21:08:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:11,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:11,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:11,592 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:11,970 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2025-03-03 21:08:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:08:11,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:11,976 INFO L225 Difference]: With dead ends: 342 [2025-03-03 21:08:11,976 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 21:08:11,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:08:11,979 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 271 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:11,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 364 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:08:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 21:08:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2025-03-03 21:08:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 192 states have internal predecessors, (269), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:08:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2025-03-03 21:08:12,028 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 137 [2025-03-03 21:08:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2025-03-03 21:08:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2025-03-03 21:08:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:12,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:12,030 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:12,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:08:12,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:12,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash -291143030, now seen corresponding path program 1 times [2025-03-03 21:08:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430524450] [2025-03-03 21:08:12,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:12,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:12,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430524450] [2025-03-03 21:08:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430524450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:08:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429266498] [2025-03-03 21:08:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:08:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:08:12,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:12,200 INFO L87 Difference]: Start difference. First operand 255 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:12,337 INFO L93 Difference]: Finished difference Result 759 states and 1161 transitions. [2025-03-03 21:08:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:08:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:12,343 INFO L225 Difference]: With dead ends: 759 [2025-03-03 21:08:12,343 INFO L226 Difference]: Without dead ends: 507 [2025-03-03 21:08:12,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:12,345 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:12,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 304 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:08:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-03 21:08:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2025-03-03 21:08:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 376 states have (on average 1.4095744680851063) internal successors, (530), 380 states have internal predecessors, (530), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:08:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 770 transitions. [2025-03-03 21:08:12,399 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 770 transitions. Word has length 137 [2025-03-03 21:08:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:12,399 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 770 transitions. [2025-03-03 21:08:12,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 770 transitions. [2025-03-03 21:08:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:12,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:12,401 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:12,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:08:12,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:12,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -796701655, now seen corresponding path program 1 times [2025-03-03 21:08:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:12,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146978160] [2025-03-03 21:08:12,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:12,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:12,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:12,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:12,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:12,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146978160] [2025-03-03 21:08:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146978160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592483913] [2025-03-03 21:08:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:12,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:12,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:12,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:12,694 INFO L87 Difference]: Start difference. First operand 505 states and 770 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:13,041 INFO L93 Difference]: Finished difference Result 1505 states and 2298 transitions. [2025-03-03 21:08:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:08:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:13,049 INFO L225 Difference]: With dead ends: 1505 [2025-03-03 21:08:13,049 INFO L226 Difference]: Without dead ends: 1003 [2025-03-03 21:08:13,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:13,052 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 202 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:13,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 379 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-03 21:08:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 999. [2025-03-03 21:08:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 742 states have (on average 1.4056603773584906) internal successors, (1043), 750 states have internal predecessors, (1043), 240 states have call successors, (240), 16 states have call predecessors, (240), 16 states have return successors, (240), 232 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-03 21:08:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1523 transitions. [2025-03-03 21:08:13,172 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1523 transitions. Word has length 137 [2025-03-03 21:08:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:13,172 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1523 transitions. [2025-03-03 21:08:13,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1523 transitions. [2025-03-03 21:08:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:13,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:13,174 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:13,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:08:13,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -585350742, now seen corresponding path program 1 times [2025-03-03 21:08:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355020390] [2025-03-03 21:08:13,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:13,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:13,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:13,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:13,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355020390] [2025-03-03 21:08:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355020390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:13,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:13,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747519978] [2025-03-03 21:08:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:13,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:13,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:13,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:13,361 INFO L87 Difference]: Start difference. First operand 999 states and 1523 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:13,728 INFO L93 Difference]: Finished difference Result 2314 states and 3525 transitions. [2025-03-03 21:08:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:08:13,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:13,737 INFO L225 Difference]: With dead ends: 2314 [2025-03-03 21:08:13,737 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 21:08:13,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:13,741 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 215 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:13,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 495 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 21:08:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1310. [2025-03-03 21:08:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 968 states have (on average 1.3915289256198347) internal successors, (1347), 978 states have internal predecessors, (1347), 319 states have call successors, (319), 22 states have call predecessors, (319), 22 states have return successors, (319), 309 states have call predecessors, (319), 319 states have call successors, (319) [2025-03-03 21:08:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1985 transitions. [2025-03-03 21:08:13,847 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1985 transitions. Word has length 137 [2025-03-03 21:08:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:13,848 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1985 transitions. [2025-03-03 21:08:13,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1985 transitions. [2025-03-03 21:08:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:13,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:13,851 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:13,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:08:13,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:13,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash 279097514, now seen corresponding path program 1 times [2025-03-03 21:08:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229660990] [2025-03-03 21:08:13,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:13,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:13,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:13,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229660990] [2025-03-03 21:08:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229660990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:14,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:14,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:08:14,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431710968] [2025-03-03 21:08:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:14,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:08:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:14,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:08:14,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:14,034 INFO L87 Difference]: Start difference. First operand 1310 states and 1985 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:14,351 INFO L93 Difference]: Finished difference Result 2431 states and 3673 transitions. [2025-03-03 21:08:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:08:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:14,361 INFO L225 Difference]: With dead ends: 2431 [2025-03-03 21:08:14,361 INFO L226 Difference]: Without dead ends: 1386 [2025-03-03 21:08:14,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:14,365 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 249 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:14,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 226 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-03 21:08:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1068. [2025-03-03 21:08:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 790 states have (on average 1.3911392405063292) internal successors, (1099), 798 states have internal predecessors, (1099), 259 states have call successors, (259), 18 states have call predecessors, (259), 18 states have return successors, (259), 251 states have call predecessors, (259), 259 states have call successors, (259) [2025-03-03 21:08:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1617 transitions. [2025-03-03 21:08:14,432 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1617 transitions. Word has length 137 [2025-03-03 21:08:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:14,432 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1617 transitions. [2025-03-03 21:08:14,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1617 transitions. [2025-03-03 21:08:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:08:14,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:14,434 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:14,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:08:14,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:14,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1632407211, now seen corresponding path program 1 times [2025-03-03 21:08:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050157752] [2025-03-03 21:08:14,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:14,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:08:14,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:08:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050157752] [2025-03-03 21:08:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050157752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178145571] [2025-03-03 21:08:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:14,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:14,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:14,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:14,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:14,637 INFO L87 Difference]: Start difference. First operand 1068 states and 1617 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:14,999 INFO L93 Difference]: Finished difference Result 2377 states and 3593 transitions. [2025-03-03 21:08:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:08:14,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:08:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:15,006 INFO L225 Difference]: With dead ends: 2377 [2025-03-03 21:08:15,006 INFO L226 Difference]: Without dead ends: 1312 [2025-03-03 21:08:15,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:08:15,009 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:15,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 418 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-03 21:08:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1068. [2025-03-03 21:08:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 790 states have (on average 1.388607594936709) internal successors, (1097), 798 states have internal predecessors, (1097), 259 states have call successors, (259), 18 states have call predecessors, (259), 18 states have return successors, (259), 251 states have call predecessors, (259), 259 states have call successors, (259) [2025-03-03 21:08:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1615 transitions. [2025-03-03 21:08:15,084 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1615 transitions. Word has length 137 [2025-03-03 21:08:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1615 transitions. [2025-03-03 21:08:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1615 transitions. [2025-03-03 21:08:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:08:15,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:15,087 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:08:15,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1698081474, now seen corresponding path program 1 times [2025-03-03 21:08:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:15,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47502762] [2025-03-03 21:08:15,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:15,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:08:15,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:08:15,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47502762] [2025-03-03 21:08:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47502762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5631644] [2025-03-03 21:08:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:15,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:15,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:15,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:15,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:15,207 INFO L87 Difference]: Start difference. First operand 1068 states and 1615 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:15,554 INFO L93 Difference]: Finished difference Result 2351 states and 3551 transitions. [2025-03-03 21:08:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:08:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:08:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:15,561 INFO L225 Difference]: With dead ends: 2351 [2025-03-03 21:08:15,561 INFO L226 Difference]: Without dead ends: 1286 [2025-03-03 21:08:15,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:08:15,564 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 231 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:15,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 315 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:08:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-03 21:08:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1264. [2025-03-03 21:08:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 923 states have (on average 1.3748645720476707) internal successors, (1269), 933 states have internal predecessors, (1269), 316 states have call successors, (316), 24 states have call predecessors, (316), 24 states have return successors, (316), 306 states have call predecessors, (316), 316 states have call successors, (316) [2025-03-03 21:08:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1901 transitions. [2025-03-03 21:08:15,658 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1901 transitions. Word has length 138 [2025-03-03 21:08:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1901 transitions. [2025-03-03 21:08:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1901 transitions. [2025-03-03 21:08:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:08:15,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:15,660 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:15,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:08:15,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1729101281, now seen corresponding path program 1 times [2025-03-03 21:08:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132165337] [2025-03-03 21:08:15,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:08:15,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:08:15,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:15,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132165337] [2025-03-03 21:08:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132165337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:08:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774021013] [2025-03-03 21:08:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:08:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:15,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:08:15,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:15,721 INFO L87 Difference]: Start difference. First operand 1264 states and 1901 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:15,868 INFO L93 Difference]: Finished difference Result 2166 states and 3259 transitions. [2025-03-03 21:08:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:08:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:08:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:15,875 INFO L225 Difference]: With dead ends: 2166 [2025-03-03 21:08:15,875 INFO L226 Difference]: Without dead ends: 1147 [2025-03-03 21:08:15,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:15,877 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 114 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:15,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:08:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-03-03 21:08:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1145. [2025-03-03 21:08:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 835 states have (on average 1.362874251497006) internal successors, (1138), 844 states have internal predecessors, (1138), 289 states have call successors, (289), 20 states have call predecessors, (289), 20 states have return successors, (289), 280 states have call predecessors, (289), 289 states have call successors, (289) [2025-03-03 21:08:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1716 transitions. [2025-03-03 21:08:15,982 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1716 transitions. Word has length 138 [2025-03-03 21:08:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:15,982 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1716 transitions. [2025-03-03 21:08:15,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1716 transitions. [2025-03-03 21:08:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 21:08:15,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:15,984 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:08:15,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1635971318, now seen corresponding path program 1 times [2025-03-03 21:08:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79411944] [2025-03-03 21:08:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:15,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:08:16,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:08:16,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:16,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:08:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269034667] [2025-03-03 21:08:16,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:16,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:16,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:16,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:16,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:08:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:08:16,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:08:16,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:16,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:16,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:08:16,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:16,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79411944] [2025-03-03 21:08:16,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:08:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269034667] [2025-03-03 21:08:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269034667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:16,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:08:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154752168] [2025-03-03 21:08:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:08:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:08:16,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:08:16,690 INFO L87 Difference]: Start difference. First operand 1145 states and 1716 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:17,359 INFO L93 Difference]: Finished difference Result 4811 states and 7219 transitions. [2025-03-03 21:08:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:08:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2025-03-03 21:08:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:17,380 INFO L225 Difference]: With dead ends: 4811 [2025-03-03 21:08:17,380 INFO L226 Difference]: Without dead ends: 3669 [2025-03-03 21:08:17,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:08:17,385 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 397 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:17,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 556 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:08:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2025-03-03 21:08:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2521. [2025-03-03 21:08:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1857 states have internal predecessors, (2483), 635 states have call successors, (635), 46 states have call predecessors, (635), 46 states have return successors, (635), 617 states have call predecessors, (635), 635 states have call successors, (635) [2025-03-03 21:08:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3753 transitions. [2025-03-03 21:08:17,562 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3753 transitions. Word has length 139 [2025-03-03 21:08:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:17,562 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3753 transitions. [2025-03-03 21:08:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3753 transitions. [2025-03-03 21:08:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 21:08:17,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:17,565 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:17,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:08:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:08:17,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 862044619, now seen corresponding path program 1 times [2025-03-03 21:08:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102073930] [2025-03-03 21:08:17,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:17,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:08:17,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:08:17,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:17,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:08:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140383719] [2025-03-03 21:08:17,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:17,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:17,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:08:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:08:17,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:08:17,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:17,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:17,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:08:17,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:18,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102073930] [2025-03-03 21:08:18,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:08:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140383719] [2025-03-03 21:08:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140383719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:08:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159294543] [2025-03-03 21:08:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:08:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:08:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:08:18,147 INFO L87 Difference]: Start difference. First operand 2521 states and 3753 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:19,016 INFO L93 Difference]: Finished difference Result 10373 states and 15512 transitions. [2025-03-03 21:08:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:08:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2025-03-03 21:08:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:19,057 INFO L225 Difference]: With dead ends: 10373 [2025-03-03 21:08:19,057 INFO L226 Difference]: Without dead ends: 7855 [2025-03-03 21:08:19,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:08:19,070 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 317 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:19,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1269 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:08:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2025-03-03 21:08:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 6221. [2025-03-03 21:08:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 4453 states have (on average 1.32809342016618) internal successors, (5914), 4501 states have internal predecessors, (5914), 1649 states have call successors, (1649), 118 states have call predecessors, (1649), 118 states have return successors, (1649), 1601 states have call predecessors, (1649), 1649 states have call successors, (1649) [2025-03-03 21:08:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 9212 transitions. [2025-03-03 21:08:19,570 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 9212 transitions. Word has length 139 [2025-03-03 21:08:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 6221 states and 9212 transitions. [2025-03-03 21:08:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 9212 transitions. [2025-03-03 21:08:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:08:19,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:19,573 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:19,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:08:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:19,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1583896637, now seen corresponding path program 1 times [2025-03-03 21:08:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843558285] [2025-03-03 21:08:19,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:19,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:08:19,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:08:19,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:19,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:08:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723167883] [2025-03-03 21:08:19,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:19,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:19,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:19,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:08:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:08:19,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:08:19,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:19,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 21:08:19,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:20,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843558285] [2025-03-03 21:08:20,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:08:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723167883] [2025-03-03 21:08:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723167883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:20,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:08:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537515364] [2025-03-03 21:08:20,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:20,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:08:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:08:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:08:20,389 INFO L87 Difference]: Start difference. First operand 6221 states and 9212 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:21,281 INFO L93 Difference]: Finished difference Result 7777 states and 11510 transitions. [2025-03-03 21:08:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:08:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-03 21:08:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:21,311 INFO L225 Difference]: With dead ends: 7777 [2025-03-03 21:08:21,311 INFO L226 Difference]: Without dead ends: 6877 [2025-03-03 21:08:21,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:08:21,318 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 451 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:21,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 993 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:08:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2025-03-03 21:08:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6245. [2025-03-03 21:08:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6245 states, 4477 states have (on average 1.3299084208175118) internal successors, (5954), 4525 states have internal predecessors, (5954), 1649 states have call successors, (1649), 118 states have call predecessors, (1649), 118 states have return successors, (1649), 1601 states have call predecessors, (1649), 1649 states have call successors, (1649) [2025-03-03 21:08:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6245 states to 6245 states and 9252 transitions. [2025-03-03 21:08:21,863 INFO L78 Accepts]: Start accepts. Automaton has 6245 states and 9252 transitions. Word has length 140 [2025-03-03 21:08:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:21,864 INFO L471 AbstractCegarLoop]: Abstraction has 6245 states and 9252 transitions. [2025-03-03 21:08:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6245 states and 9252 transitions. [2025-03-03 21:08:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:08:21,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:21,867 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:21,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:08:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:22,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:22,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash -625545083, now seen corresponding path program 1 times [2025-03-03 21:08:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:22,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255258790] [2025-03-03 21:08:22,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:22,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:08:22,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:08:22,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:22,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:08:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771597588] [2025-03-03 21:08:22,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:22,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:22,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:08:22,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:08:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:08:22,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:22,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:08:22,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:08:22,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:08:22,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:08:22,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:22,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:08:22,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:08:22,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:08:22,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:08:22,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 21:08:22,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 21:08:22,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:22,633 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:08:22,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:08:22 BoogieIcfgContainer [2025-03-03 21:08:22,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:08:22,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:08:22,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:08:22,666 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:08:22,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:10" (3/4) ... [2025-03-03 21:08:22,668 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:08:22,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:08:22,670 INFO L158 Benchmark]: Toolchain (without parser) took 13223.60ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 106.1MB in the beginning and 586.6MB in the end (delta: -480.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2025-03-03 21:08:22,670 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.79ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 90.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: Boogie Preprocessor took 63.46ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.9MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: IcfgBuilder took 477.86ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 54.6MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: TraceAbstraction took 12336.87ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 53.6MB in the beginning and 586.8MB in the end (delta: -533.1MB). Peak memory consumption was 383.0MB. Max. memory is 16.1GB. [2025-03-03 21:08:22,672 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 679.5MB. Free memory was 586.8MB in the beginning and 586.6MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:22,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.79ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 90.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.46ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.9MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 477.86ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 54.6MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12336.87ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 53.6MB in the beginning and 586.8MB in the end (delta: -533.1MB). Peak memory consumption was 383.0MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 679.5MB. Free memory was 586.8MB in the beginning and 586.6MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] COND FALSE !(\read(var_1_2)) [L68] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L70] COND TRUE var_1_17 == var_1_18 [L71] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L73] COND TRUE var_1_16 < var_1_11 [L74] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR var_1_18 & var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR (var_1_18 & var_1_17) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) <= ((var_1_18 & var_1_17) & var_1_18) [L85] var_1_38 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L87] COND TRUE ! var_1_2 [L88] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L92] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L97] var_1_27 = var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L98] COND TRUE var_1_20 < var_1_17 [L99] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L101] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L105] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L113] COND TRUE var_1_4 <= last_1_var_1_1 [L114] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L118] var_1_21 = var_1_5 [L119] var_1_37 = (var_1_2 && var_1_25) [L120] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L121] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L122] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L126] COND FALSE !(var_1_4 < (- var_1_5)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L133] COND FALSE !(var_1_20 < ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2869 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2869 mSDsluCounter, 5685 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3644 mSDsCounter, 533 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3027 IncrementalHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 533 mSolverCounterUnsat, 2041 mSDtfsCounter, 3027 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6245occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 4019 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2488 NumberOfCodeBlocks, 2488 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1777 ConstructedInterpolants, 0 QuantifiedInterpolants, 5374 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1439 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 8856/8892 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:08:22,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:08:24,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:08:24,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:08:24,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:08:24,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:08:24,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:08:24,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:08:24,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:08:24,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:08:24,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:08:24,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:08:24,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:08:24,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:08:24,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:08:24,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:08:24,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:08:24,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:08:24,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:08:24,764 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:08:24,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:08:24,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:24,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:08:24,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:08:24,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:08:24,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:08:24,766 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:08:24,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2025-03-03 21:08:25,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:08:25,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:08:25,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:08:25,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:08:25,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:08:25,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:26,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2d0ae31/a391679ec09f4ec39a2ecb67f434df32/FLAG7b9f3413b [2025-03-03 21:08:26,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:08:26,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:26,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2d0ae31/a391679ec09f4ec39a2ecb67f434df32/FLAG7b9f3413b [2025-03-03 21:08:26,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2d0ae31/a391679ec09f4ec39a2ecb67f434df32 [2025-03-03 21:08:26,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:08:26,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:08:26,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:26,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:08:26,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:08:26,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:26" (1/1) ... [2025-03-03 21:08:26,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d76b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:26, skipping insertion in model container [2025-03-03 21:08:26,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:26" (1/1) ... [2025-03-03 21:08:26,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:08:26,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2025-03-03 21:08:27,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:27,049 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:08:27,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2025-03-03 21:08:27,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:27,102 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:08:27,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27 WrapperNode [2025-03-03 21:08:27,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:27,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:27,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:08:27,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:08:27,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,150 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-03 21:08:27,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:27,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:08:27,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:08:27,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:08:27,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,185 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]. [2025-03-03 21:08:27,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:08:27,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:08:27,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:08:27,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:08:27,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (1/1) ... [2025-03-03 21:08:27,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:27,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:27,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:08:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:08:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:08:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:08:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:08:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:08:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:08:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:08:27,320 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:08:27,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:08:40,923 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:08:40,923 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:08:40,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:08:40,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:08:40,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:40 BoogieIcfgContainer [2025-03-03 21:08:40,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:08:40,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:08:40,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:08:40,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:08:40,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:08:26" (1/3) ... [2025-03-03 21:08:40,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55d957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:40, skipping insertion in model container [2025-03-03 21:08:40,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:27" (2/3) ... [2025-03-03 21:08:40,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55d957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:40, skipping insertion in model container [2025-03-03 21:08:40,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:40" (3/3) ... [2025-03-03 21:08:40,938 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2025-03-03 21:08:40,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:08:40,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:08:40,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:08:41,003 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;@1a29a495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:08:41,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:08:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:08:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 21:08:41,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:41,014 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:41,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:41,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1407733009, now seen corresponding path program 1 times [2025-03-03 21:08:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:08:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689432431] [2025-03-03 21:08:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:41,026 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 [2025-03-03 21:08:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:08:41,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:08:41,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:08:41,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 21:08:41,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 21:08:41,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:41,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:41,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:08:41,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-03 21:08:41,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:41,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:08:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689432431] [2025-03-03 21:08:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689432431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:08:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304568408] [2025-03-03 21:08:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:08:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:08:41,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:08:41,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:41,832 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:08:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:41,850 INFO L93 Difference]: Finished difference Result 141 states and 244 transitions. [2025-03-03 21:08:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:08:41,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2025-03-03 21:08:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:41,857 INFO L225 Difference]: With dead ends: 141 [2025-03-03 21:08:41,857 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 21:08:41,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:41,864 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:41,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 21:08:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 21:08:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:08:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2025-03-03 21:08:41,898 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 132 [2025-03-03 21:08:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2025-03-03 21:08:41,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:08:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2025-03-03 21:08:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 21:08:41,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:41,909 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:41,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:08:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:08:42,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1316204788, now seen corresponding path program 1 times [2025-03-03 21:08:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:08:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250218413] [2025-03-03 21:08:42,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:42,113 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 [2025-03-03 21:08:42,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:08:42,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:08:42,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:08:42,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 21:08:42,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 21:08:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:42,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:08:42,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:08:45,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:45,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:08:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250218413] [2025-03-03 21:08:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250218413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:45,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:08:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672984414] [2025-03-03 21:08:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:08:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:08:45,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:08:45,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:45,576 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:49,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:08:53,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:08:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:53,864 INFO L93 Difference]: Finished difference Result 204 states and 318 transitions. [2025-03-03 21:08:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:08:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2025-03-03 21:08:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:53,949 INFO L225 Difference]: With dead ends: 204 [2025-03-03 21:08:53,949 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 21:08:53,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:53,950 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:53,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 21:08:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 21:08:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-03-03 21:08:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:08:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2025-03-03 21:08:53,971 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 132 [2025-03-03 21:08:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2025-03-03 21:08:53,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:08:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2025-03-03 21:08:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 21:08:53,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:53,972 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:53,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:08:54,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:08:54,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:54,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1187122069, now seen corresponding path program 1 times [2025-03-03 21:08:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:08:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602565510] [2025-03-03 21:08:54,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:54,174 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 [2025-03-03 21:08:54,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:08:54,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:08:54,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:08:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 21:08:54,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 21:08:54,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:54,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:54,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:08:54,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:09:02,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:02,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:09:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602565510] [2025-03-03 21:09:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602565510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:09:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772785330] [2025-03-03 21:09:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:09:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:09:02,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:09:02,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:09:02,920 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:09:10,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:14,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:18,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:22,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:26,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:30,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:33,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []