./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/recursive/gcd02.c -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 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:36,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:36,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:36,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:36,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:36,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:36,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:36,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:36,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:36,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:36,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:36,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:36,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:36,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:36,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:36,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:36,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:36,953 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 -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 [2025-03-08 05:42:37,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:37,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:37,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:37,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:37,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:37,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd02.c [2025-03-08 05:42:38,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d07c219/0317043166a543d98a5120afee6bdc3f/FLAG9aca0b2ba [2025-03-08 05:42:38,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:38,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2025-03-08 05:42:38,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d07c219/0317043166a543d98a5120afee6bdc3f/FLAG9aca0b2ba [2025-03-08 05:42:38,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d07c219/0317043166a543d98a5120afee6bdc3f [2025-03-08 05:42:38,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:38,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:38,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:38,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:38,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:38,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7035306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38, skipping insertion in model container [2025-03-08 05:42:38,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:38,798 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/recursive/gcd02.c[623,636] [2025-03-08 05:42:38,809 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/recursive/gcd02.c[1283,1296] [2025-03-08 05:42:38,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:38,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:38,824 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/recursive/gcd02.c[623,636] [2025-03-08 05:42:38,827 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/recursive/gcd02.c[1283,1296] [2025-03-08 05:42:38,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:38,840 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:38,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38 WrapperNode [2025-03-08 05:42:38,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:38,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:38,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:38,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:38,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,863 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-08 05:42:38,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:38,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:38,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:38,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:38,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,883 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 05:42:38,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:38,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:38,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:38,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:38,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (1/1) ... [2025-03-08 05:42:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:38,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:38,917 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-08 05:42:38,919 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-08 05:42:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2025-03-08 05:42:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2025-03-08 05:42:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:42:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2025-03-08 05:42:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2025-03-08 05:42:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:38,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:38,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:39,038 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc #t~ret6; [2025-03-08 05:42:39,054 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: havoc #t~ret5; [2025-03-08 05:42:39,054 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc #t~ret4; [2025-03-08 05:42:39,111 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:39,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:39,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:39,121 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:39,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:39 BoogieIcfgContainer [2025-03-08 05:42:39,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:39,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:39,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:39,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:39,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:38" (1/3) ... [2025-03-08 05:42:39,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66858ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:39, skipping insertion in model container [2025-03-08 05:42:39,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:38" (2/3) ... [2025-03-08 05:42:39,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66858ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:39, skipping insertion in model container [2025-03-08 05:42:39,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:39" (3/3) ... [2025-03-08 05:42:39,131 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd02.c [2025-03-08 05:42:39,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:39,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd02.c that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 05:42:39,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:39,194 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;@4732a74f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:39,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 05:42:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 05:42:39,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:39,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1662062202, now seen corresponding path program 1 times [2025-03-08 05:42:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123093391] [2025-03-08 05:42:39,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 05:42:39,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 05:42:39,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:39,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:39,464 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-08 05:42:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123093391] [2025-03-08 05:42:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123093391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:39,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:39,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:42:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706625694] [2025-03-08 05:42:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:42:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:39,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:42:39,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:39,483 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-08 05:42:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:39,580 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2025-03-08 05:42:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-08 05:42:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:39,589 INFO L225 Difference]: With dead ends: 78 [2025-03-08 05:42:39,589 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:42:39,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:39,594 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:39,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:42:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 05:42:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:42:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-08 05:42:39,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2025-03-08 05:42:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-08 05:42:39,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-08 05:42:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-08 05:42:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 05:42:39,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,621 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:39,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1629548401, now seen corresponding path program 1 times [2025-03-08 05:42:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016044070] [2025-03-08 05:42:39,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 05:42:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 05:42:39,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:39,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016044070] [2025-03-08 05:42:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016044070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:39,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:42:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308767579] [2025-03-08 05:42:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:39,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:42:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:39,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:42:39,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:39,785 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:39,912 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2025-03-08 05:42:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 05:42:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:39,913 INFO L225 Difference]: With dead ends: 65 [2025-03-08 05:42:39,913 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 05:42:39,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:39,914 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:39,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 161 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 05:42:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2025-03-08 05:42:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:42:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-03-08 05:42:39,927 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 14 [2025-03-08 05:42:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:39,927 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-03-08 05:42:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-03-08 05:42:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 05:42:39,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,928 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:39,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:39,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1630412340, now seen corresponding path program 1 times [2025-03-08 05:42:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210001237] [2025-03-08 05:42:39,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 05:42:39,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 05:42:39,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:39,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210001237] [2025-03-08 05:42:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210001237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:42:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99993926] [2025-03-08 05:42:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:42:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:42:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:40,051 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:40,130 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-03-08 05:42:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:40,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 05:42:40,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:40,131 INFO L225 Difference]: With dead ends: 63 [2025-03-08 05:42:40,131 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 05:42:40,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:40,132 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:40,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 05:42:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2025-03-08 05:42:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:42:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-03-08 05:42:40,145 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 14 [2025-03-08 05:42:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-08 05:42:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-03-08 05:42:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 05:42:40,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:40,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:40,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:42:40,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2042947031, now seen corresponding path program 1 times [2025-03-08 05:42:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815646853] [2025-03-08 05:42:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 05:42:40,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 05:42:40,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:40,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,206 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-08 05:42:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815646853] [2025-03-08 05:42:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815646853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:42:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617153584] [2025-03-08 05:42:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:42:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:40,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:42:40,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:42:40,208 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:40,217 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-03-08 05:42:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:42:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-08 05:42:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:40,218 INFO L225 Difference]: With dead ends: 55 [2025-03-08 05:42:40,218 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 05:42:40,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:42:40,218 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:40,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 05:42:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 05:42:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-08 05:42:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-03-08 05:42:40,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 20 [2025-03-08 05:42:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:40,224 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-03-08 05:42:40,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-03-08 05:42:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 05:42:40,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:40,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:40,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:42:40,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:40,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -393327195, now seen corresponding path program 1 times [2025-03-08 05:42:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:40,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547306436] [2025-03-08 05:42:40,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:40,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 05:42:40,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 05:42:40,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:40,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,326 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-08 05:42:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547306436] [2025-03-08 05:42:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547306436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:40,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:40,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:42:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217522421] [2025-03-08 05:42:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:40,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:42:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:40,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:42:40,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:40,328 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:42:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:40,470 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-08 05:42:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-08 05:42:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:40,471 INFO L225 Difference]: With dead ends: 69 [2025-03-08 05:42:40,471 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 05:42:40,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:40,472 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:40,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 143 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 05:42:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-03-08 05:42:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-08 05:42:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2025-03-08 05:42:40,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 21 [2025-03-08 05:42:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-03-08 05:42:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:42:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2025-03-08 05:42:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 05:42:40,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:40,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-08 05:42:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:42:40,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -484565858, now seen corresponding path program 1 times [2025-03-08 05:42:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525717592] [2025-03-08 05:42:40,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:42:40,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:42:40,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:40,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525717592] [2025-03-08 05:42:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525717592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:40,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:40,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924231084] [2025-03-08 05:42:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:40,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:40,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:40,537 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:42:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:40,552 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2025-03-08 05:42:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-08 05:42:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:40,553 INFO L225 Difference]: With dead ends: 64 [2025-03-08 05:42:40,553 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 05:42:40,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:40,554 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:40,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 05:42:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 05:42:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-08 05:42:40,582 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 27 [2025-03-08 05:42:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:40,582 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-08 05:42:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:42:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-08 05:42:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:42:40,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:40,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:42:40,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1663324822, now seen corresponding path program 1 times [2025-03-08 05:42:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008005705] [2025-03-08 05:42:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:40,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:42:40,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:42:40,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:40,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008005705] [2025-03-08 05:42:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008005705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042654177] [2025-03-08 05:42:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:40,771 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-08 05:42:40,772 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-08 05:42:40,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:42:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:42:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:40,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 05:42:40,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:40,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042654177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:41,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2025-03-08 05:42:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132307871] [2025-03-08 05:42:41,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:41,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:42:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:41,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:42:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:41,041 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:41,203 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2025-03-08 05:42:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 28 [2025-03-08 05:42:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:41,205 INFO L225 Difference]: With dead ends: 63 [2025-03-08 05:42:41,206 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 05:42:41,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:42:41,207 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:41,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 126 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 05:42:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-03-08 05:42:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:42:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-08 05:42:41,227 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 28 [2025-03-08 05:42:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-08 05:42:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-08 05:42:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:42:41,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:41,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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-08 05:42:41,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:41,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 717215749, now seen corresponding path program 1 times [2025-03-08 05:42:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686438811] [2025-03-08 05:42:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:42:41,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:42:41,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:41,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:41,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686438811] [2025-03-08 05:42:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686438811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:41,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:42:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060683916] [2025-03-08 05:42:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:41,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:41,552 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:41,668 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2025-03-08 05:42:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2025-03-08 05:42:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:41,669 INFO L225 Difference]: With dead ends: 74 [2025-03-08 05:42:41,669 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 05:42:41,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:41,670 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:41,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 05:42:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2025-03-08 05:42:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-08 05:42:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-03-08 05:42:41,679 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 29 [2025-03-08 05:42:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:41,679 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-03-08 05:42:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-03-08 05:42:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:42:41,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:41,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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-08 05:42:41,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:42:41,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:41,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1840737257, now seen corresponding path program 1 times [2025-03-08 05:42:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:41,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549675551] [2025-03-08 05:42:41,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:42:41,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:42:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:42:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549675551] [2025-03-08 05:42:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549675551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170809923] [2025-03-08 05:42:41,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:41,793 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-08 05:42:41,793 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-08 05:42:41,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:42:41,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:42:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:42:41,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:42:41,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170809923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:42,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2025-03-08 05:42:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811250018] [2025-03-08 05:42:42,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:42:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:42,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:42:42,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:42:42,178 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-08 05:42:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:42,387 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2025-03-08 05:42:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:42:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 29 [2025-03-08 05:42:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:42,388 INFO L225 Difference]: With dead ends: 82 [2025-03-08 05:42:42,388 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 05:42:42,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:42,389 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:42,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 259 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 05:42:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2025-03-08 05:42:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-08 05:42:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2025-03-08 05:42:42,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 29 [2025-03-08 05:42:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:42,402 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2025-03-08 05:42:42,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-08 05:42:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2025-03-08 05:42:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:42:42,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:42,403 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-08 05:42:42,409 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-08 05:42:42,608 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,SelfDestructingSolverStorable8 [2025-03-08 05:42:42,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash -831235018, now seen corresponding path program 1 times [2025-03-08 05:42:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237845537] [2025-03-08 05:42:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:42,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:42:42,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:42:42,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:42:42,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237845537] [2025-03-08 05:42:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237845537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841338635] [2025-03-08 05:42:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:42,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:42,774 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-08 05:42:42,775 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-08 05:42:42,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:42:42,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:42:42,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:42,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:42,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 05:42:42,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:42:42,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:42:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841338635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:43,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2025-03-08 05:42:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391412935] [2025-03-08 05:42:43,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:43,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:42:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:43,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:42:43,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:43,016 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:42:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:43,194 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2025-03-08 05:42:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:43,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-03-08 05:42:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:43,196 INFO L225 Difference]: With dead ends: 78 [2025-03-08 05:42:43,196 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 05:42:43,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:43,197 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:43,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 177 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 05:42:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2025-03-08 05:42:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-08 05:42:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2025-03-08 05:42:43,209 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 36 [2025-03-08 05:42:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-03-08 05:42:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:42:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2025-03-08 05:42:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:42:43,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:43,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-08 05:42:43,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:43,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1760387026, now seen corresponding path program 1 times [2025-03-08 05:42:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753107678] [2025-03-08 05:42:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:43,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:42:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:42:43,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:43,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:42:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753107678] [2025-03-08 05:42:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753107678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368387244] [2025-03-08 05:42:43,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:43,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:43,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:43,592 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-08 05:42:43,593 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-08 05:42:43,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:42:43,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:42:43,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:43,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:43,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:42:43,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:43,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:42:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368387244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:44,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:44,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2025-03-08 05:42:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379581669] [2025-03-08 05:42:44,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:42:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:42:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:44,213 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:44,414 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2025-03-08 05:42:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:42:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 36 [2025-03-08 05:42:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:44,416 INFO L225 Difference]: With dead ends: 88 [2025-03-08 05:42:44,416 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 05:42:44,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:42:44,417 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:44,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 198 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 05:42:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2025-03-08 05:42:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (26), 16 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:42:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-03-08 05:42:44,426 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 36 [2025-03-08 05:42:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:44,426 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-03-08 05:42:44,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-03-08 05:42:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:42:44,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:44,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 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-08 05:42:44,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:44,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:44,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1693115327, now seen corresponding path program 1 times [2025-03-08 05:42:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023215756] [2025-03-08 05:42:44,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:44,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:42:44,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:44,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:44,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:42:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023215756] [2025-03-08 05:42:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023215756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177738818] [2025-03-08 05:42:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:44,744 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-08 05:42:44,746 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-08 05:42:44,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:42:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:44,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:44,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:42:44,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:42:44,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:42:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177738818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:45,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 19 [2025-03-08 05:42:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499414538] [2025-03-08 05:42:45,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:45,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:42:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:45,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:42:45,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:42:45,230 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:45,410 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2025-03-08 05:42:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:42:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2025-03-08 05:42:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:45,412 INFO L225 Difference]: With dead ends: 81 [2025-03-08 05:42:45,412 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 05:42:45,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:42:45,412 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:45,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 176 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 05:42:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2025-03-08 05:42:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-08 05:42:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-08 05:42:45,422 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 37 [2025-03-08 05:42:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:45,422 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-08 05:42:45,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-08 05:42:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:42:45,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:45,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 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-08 05:42:45,430 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-08 05:42:45,623 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,SelfDestructingSolverStorable11 [2025-03-08 05:42:45,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:45,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1831935098, now seen corresponding path program 1 times [2025-03-08 05:42:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:45,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591175232] [2025-03-08 05:42:45,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:45,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:42:45,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:45,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:45,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:42:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591175232] [2025-03-08 05:42:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591175232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040892706] [2025-03-08 05:42:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:45,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:45,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:42:45,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:42:45,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:45,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:45,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:45,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 05:42:45,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:42:45,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:42:46,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040892706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:46,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:46,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 21 [2025-03-08 05:42:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602422506] [2025-03-08 05:42:46,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:46,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:42:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:46,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:42:46,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:46,525 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 05:42:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:46,745 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2025-03-08 05:42:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 44 [2025-03-08 05:42:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:46,747 INFO L225 Difference]: With dead ends: 87 [2025-03-08 05:42:46,747 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 05:42:46,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:42:46,748 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:46,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 225 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 05:42:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2025-03-08 05:42:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 10 states have return successors, (22), 16 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-08 05:42:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2025-03-08 05:42:46,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 44 [2025-03-08 05:42:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2025-03-08 05:42:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 05:42:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2025-03-08 05:42:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:42:46,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:46,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:46,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:42:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:46,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 482868675, now seen corresponding path program 2 times [2025-03-08 05:42:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871531969] [2025-03-08 05:42:46,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:46,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 05:42:46,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:42:46,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:46,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:42:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871531969] [2025-03-08 05:42:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871531969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267137942] [2025-03-08 05:42:47,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:47,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:47,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:42:47,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 05:42:47,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:42:47,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 05:42:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:42:47,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267137942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:47,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:47,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 21 [2025-03-08 05:42:47,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337331795] [2025-03-08 05:42:47,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:47,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:42:47,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:47,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:42:47,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:47,602 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:47,799 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2025-03-08 05:42:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 43 [2025-03-08 05:42:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:47,800 INFO L225 Difference]: With dead ends: 84 [2025-03-08 05:42:47,801 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 05:42:47,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:42:47,801 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:47,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 246 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 05:42:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-03-08 05:42:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 10 states have call successors, (10), 4 states have call predecessors, (10), 10 states have return successors, (21), 15 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 05:42:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-08 05:42:47,811 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 43 [2025-03-08 05:42:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:47,811 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-08 05:42:47,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:42:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-08 05:42:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:42:47,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:47,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 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-08 05:42:47,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:48,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 673467442, now seen corresponding path program 2 times [2025-03-08 05:42:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689278110] [2025-03-08 05:42:48,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:48,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 05:42:48,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:48,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689278110] [2025-03-08 05:42:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689278110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625114345] [2025-03-08 05:42:48,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:48,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:48,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:48,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:42:48,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 05:42:48,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:48,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 05:42:48,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:48,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625114345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:49,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 36 [2025-03-08 05:42:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364469658] [2025-03-08 05:42:49,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 05:42:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:49,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 05:42:49,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:42:49,255 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 36 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-08 05:42:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:49,693 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2025-03-08 05:42:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 05:42:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Word has length 44 [2025-03-08 05:42:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:49,695 INFO L225 Difference]: With dead ends: 109 [2025-03-08 05:42:49,695 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 05:42:49,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1904, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 05:42:49,696 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 438 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 05:42:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2025-03-08 05:42:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 52 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (27), 19 states have call predecessors, (27), 10 states have call successors, (27) [2025-03-08 05:42:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2025-03-08 05:42:49,704 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 44 [2025-03-08 05:42:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2025-03-08 05:42:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-08 05:42:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2025-03-08 05:42:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:42:49,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:49,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:49,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:42:49,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:49,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1353667350, now seen corresponding path program 3 times [2025-03-08 05:42:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044117819] [2025-03-08 05:42:49,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:49,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-08 05:42:49,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:49,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:42:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044117819] [2025-03-08 05:42:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044117819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551603340] [2025-03-08 05:42:50,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:50,143 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:50,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:42:50,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-08 05:42:50,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:42:50,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:42:50,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:50,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 05:42:50,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:50,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:44:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:44:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551603340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:44:11,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:44:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 40 [2025-03-08 05:44:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574394794] [2025-03-08 05:44:11,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:44:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 05:44:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:44:11,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 05:44:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1431, Unknown=1, NotChecked=0, Total=1560 [2025-03-08 05:44:11,056 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 31 states have internal predecessors, (78), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-08 05:44:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:44:11,526 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-03-08 05:44:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:44:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 31 states have internal predecessors, (78), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) Word has length 44 [2025-03-08 05:44:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:44:11,529 INFO L225 Difference]: With dead ends: 102 [2025-03-08 05:44:11,529 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 05:44:11,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=207, Invalid=1862, Unknown=1, NotChecked=0, Total=2070 [2025-03-08 05:44:11,530 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:44:11,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 506 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:44:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 05:44:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2025-03-08 05:44:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-08 05:44:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2025-03-08 05:44:11,540 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 44 [2025-03-08 05:44:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:44:11,540 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2025-03-08 05:44:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 31 states have internal predecessors, (78), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-08 05:44:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2025-03-08 05:44:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:44:11,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:44:11,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 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-08 05:44:11,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:44:11,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:44:11,746 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:44:11,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:44:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1848023882, now seen corresponding path program 3 times [2025-03-08 05:44:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:44:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359844851] [2025-03-08 05:44:11,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:44:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:44:11,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-03-08 05:44:11,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:44:11,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 05:44:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:44:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:44:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:44:12,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359844851] [2025-03-08 05:44:12,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359844851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:44:12,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635812811] [2025-03-08 05:44:12,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:44:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:44:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:44:12,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:44:12,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:44:12,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-03-08 05:44:12,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:44:12,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 05:44:12,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:44:12,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 05:44:12,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:44:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:44:12,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:44:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:44:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635812811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:44:13,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:44:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 20] total 46 [2025-03-08 05:44:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506049435] [2025-03-08 05:44:13,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:44:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 05:44:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:44:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 05:44:13,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 05:44:13,892 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 46 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 35 states have internal predecessors, (87), 15 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18)