./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.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/nla-digbench-scaling/divbin2_valuebound2.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 b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:47:38,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:47:38,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:47:38,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:47:38,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:47:38,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:47:38,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:47:38,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:47:38,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:47:38,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:47:38,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:47:38,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:47:38,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:47:38,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:47:38,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:47:38,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:47:38,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:47:38,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:47:38,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:47:38,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:47:38,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:47:38,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:47:38,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:47:38,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:47:38,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:47:38,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:47:38,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:47:38,459 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 -> b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea [2025-03-03 13:47:38,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:47:38,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:47:38,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:47:38,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:47:38,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:47:38,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2025-03-03 13:47:39,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f4bf46/6f4fe903ca864d7d9ea6dc576da8b30d/FLAG38cdadc8f [2025-03-03 13:47:39,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:47:39,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2025-03-03 13:47:39,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f4bf46/6f4fe903ca864d7d9ea6dc576da8b30d/FLAG38cdadc8f [2025-03-03 13:47:39,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f4bf46/6f4fe903ca864d7d9ea6dc576da8b30d [2025-03-03 13:47:40,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:47:40,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:47:40,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:47:40,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:47:40,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:47:40,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fb98b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40, skipping insertion in model container [2025-03-03 13:47:40,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:47:40,128 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/nla-digbench-scaling/divbin2_valuebound2.i[951,964] [2025-03-03 13:47:40,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:47:40,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:47:40,153 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/nla-digbench-scaling/divbin2_valuebound2.i[951,964] [2025-03-03 13:47:40,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:47:40,165 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:47:40,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40 WrapperNode [2025-03-03 13:47:40,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:47:40,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:47:40,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:47:40,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:47:40,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,188 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-03 13:47:40,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:47:40,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:47:40,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:47:40,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:47:40,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,203 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 13:47:40,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:47:40,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:47:40,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:47:40,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:47:40,209 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (1/1) ... [2025-03-03 13:47:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:47:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:47:40,230 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 13:47:40,234 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 13:47:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:47:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:47:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:47:40,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:47:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:47:40,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:47:40,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:47:40,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:47:40,381 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:47:40,381 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:47:40,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:47:40,387 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:47:40,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:47:40 BoogieIcfgContainer [2025-03-03 13:47:40,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:47:40,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:47:40,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:47:40,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:47:40,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:47:40" (1/3) ... [2025-03-03 13:47:40,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37787642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:47:40, skipping insertion in model container [2025-03-03 13:47:40,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:47:40" (2/3) ... [2025-03-03 13:47:40,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37787642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:47:40, skipping insertion in model container [2025-03-03 13:47:40,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:47:40" (3/3) ... [2025-03-03 13:47:40,394 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2025-03-03 13:47:40,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:47:40,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_valuebound2.i that has 2 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:47:40,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:47:40,455 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;@6002492d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:47:40,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:47:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:47:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:47:40,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:40,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:40,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:40,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash 295736012, now seen corresponding path program 1 times [2025-03-03 13:47:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919695939] [2025-03-03 13:47:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:40,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:47:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:47:40,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:40,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:47:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919695939] [2025-03-03 13:47:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919695939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:47:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:47:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:47:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486934529] [2025-03-03 13:47:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:47:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:47:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:47:40,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:47:40,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:47:40,581 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:47:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:47:40,589 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2025-03-03 13:47:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:47:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 13:47:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:47:40,593 INFO L225 Difference]: With dead ends: 35 [2025-03-03 13:47:40,593 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 13:47:40,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:47:40,596 INFO L435 NwaCegarLoop]: 22 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, 22 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 13:47:40,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:47:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 13:47:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 13:47:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:47:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-03 13:47:40,614 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 9 [2025-03-03 13:47:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:47:40,615 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-03 13:47:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:47:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-03-03 13:47:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:47:40,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:40,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:47:40,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1180469130, now seen corresponding path program 1 times [2025-03-03 13:47:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313497538] [2025-03-03 13:47:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:47:40,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:47:40,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:40,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:47:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237647151] [2025-03-03 13:47:40,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:40,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:40,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:47:40,634 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 13:47:40,635 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 13:47:40,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:47:40,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:47:40,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:40,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:40,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:47:40,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:47:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:47:40,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:47:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313497538] [2025-03-03 13:47:40,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:47:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237647151] [2025-03-03 13:47:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237647151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:47:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:47:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:47:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877783378] [2025-03-03 13:47:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:47:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:47:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:47:40,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:47:40,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:47:40,765 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:47:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:47:40,827 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-03 13:47:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:47:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 13:47:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:47:40,829 INFO L225 Difference]: With dead ends: 25 [2025-03-03 13:47:40,829 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:47:40,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:47:40,830 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:47:40,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:47:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:47:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 13:47:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:47:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-03 13:47:40,838 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2025-03-03 13:47:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:47:40,838 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-03 13:47:40,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:47:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-03 13:47:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:47:40,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:40,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:40,845 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 13:47:41,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:41,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:41,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1201483927, now seen corresponding path program 1 times [2025-03-03 13:47:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047971990] [2025-03-03 13:47:41,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:41,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:47:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:47:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:41,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:47:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:41,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047971990] [2025-03-03 13:47:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047971990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:47:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:47:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:47:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434296302] [2025-03-03 13:47:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:47:41,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:47:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:47:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:47:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:47:41,274 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:47:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:47:41,292 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2025-03-03 13:47:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:47:41,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-03 13:47:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:47:41,293 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:47:41,293 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:47:41,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 13:47:41,294 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:47:41,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:47:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:47:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 13:47:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:47:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 13:47:41,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-03-03 13:47:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:47:41,298 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 13:47:41,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:47:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 13:47:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:47:41,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:41,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:41,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:47:41,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:41,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash -301260484, now seen corresponding path program 1 times [2025-03-03 13:47:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943847396] [2025-03-03 13:47:41,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:41,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:47:41,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:47:41,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:41,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:47:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107976604] [2025-03-03 13:47:41,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:47:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:47:41,339 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 13:47:41,340 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 13:47:41,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:47:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:47:41,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:47:41,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:47:41,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:47:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:47:41,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:47:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943847396] [2025-03-03 13:47:50,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:47:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107976604] [2025-03-03 13:47:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107976604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:47:50,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:47:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 13:47:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177790842] [2025-03-03 13:47:50,902 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:47:50,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:47:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:47:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:47:50,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=51, Unknown=2, NotChecked=0, Total=72 [2025-03-03 13:47:50,903 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:47:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:47:50,973 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-03 13:47:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:47:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-03 13:47:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:47:50,973 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:47:50,974 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:47:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2025-03-03 13:47:50,974 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 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 13:47:50,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:47:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:47:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 13:47:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:47:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-03 13:47:50,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2025-03-03 13:47:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:47:50,978 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-03 13:47:50,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:47:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-03 13:47:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:47:50,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:50,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:50,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:47:51,179 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,SelfDestructingSolverStorable3 [2025-03-03 13:47:51,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2136426871, now seen corresponding path program 2 times [2025-03-03 13:47:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:51,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031344584] [2025-03-03 13:47:51,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:47:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:51,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:47:51,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:47:51,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:47:51,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:47:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031344584] [2025-03-03 13:47:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031344584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:47:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868604258] [2025-03-03 13:47:51,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:47:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:47:51,505 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 13:47:51,506 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 13:47:51,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:47:51,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:47:51,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:47:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:51,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:47:51,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:47:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:47:51,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:47:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:47:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868604258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:47:51,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:47:51,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 13 [2025-03-03 13:47:51,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393597027] [2025-03-03 13:47:51,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:47:51,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:47:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:47:51,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:47:51,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:47:51,838 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:47:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:47:51,890 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-03-03 13:47:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:47:51,890 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2025-03-03 13:47:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:47:51,891 INFO L225 Difference]: With dead ends: 60 [2025-03-03 13:47:51,891 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 13:47:51,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:47:51,892 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:47:51,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:47:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 13:47:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-03 13:47:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:47:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-03 13:47:51,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2025-03-03 13:47:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:47:51,897 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-03 13:47:51,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:47:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-03 13:47:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:47:51,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:47:51,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:47:51,903 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 13:47:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:52,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:47:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:47:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1753618506, now seen corresponding path program 3 times [2025-03-03 13:47:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:47:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603386465] [2025-03-03 13:47:52,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:47:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:47:52,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:47:52,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:47:52,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:47:52,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:47:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:47:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603386465] [2025-03-03 13:47:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603386465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:47:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641518071] [2025-03-03 13:47:52,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:47:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:47:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:47:52,753 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 13:47:52,755 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 13:47:52,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:47:52,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:47:52,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:47:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:47:52,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 13:47:52,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:47:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:47:53,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:49:21,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641518071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:49:21,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:49:21,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 16] total 34 [2025-03-03 13:49:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442628042] [2025-03-03 13:49:21,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:49:21,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:49:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:21,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:49:21,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=941, Unknown=18, NotChecked=0, Total=1122 [2025-03-03 13:49:21,784 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 34 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)