./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:25:04,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:25:04,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:25:04,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:25:04,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:25:04,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:25:04,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:25:04,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:25:04,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:25:04,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:25:04,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:25:04,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:25:04,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:25:04,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:25:04,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:25:04,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:25:04,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:25:04,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:25:04,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:25:04,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:25:04,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:25:04,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:25:04,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:25:04,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:25:04,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:25:04,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:25:04,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:25:04,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:25:04,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:25:04,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:25:04,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:25:04,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:25:04,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b [2024-11-16 09:25:04,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:25:04,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:25:04,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:25:04,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:25:04,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:25:04,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i [2024-11-16 09:25:05,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:25:05,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:25:05,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i [2024-11-16 09:25:05,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112644a19/287378f9257f4a84b9714ecf3e269d04/FLAG6f3861338 [2024-11-16 09:25:06,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112644a19/287378f9257f4a84b9714ecf3e269d04 [2024-11-16 09:25:06,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:25:06,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:25:06,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:25:06,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:25:06,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:25:06,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fc3ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06, skipping insertion in model container [2024-11-16 09:25:06,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:25:06,306 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/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-16 09:25:06,323 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/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-16 09:25:06,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:25:06,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:25:06,347 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/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-16 09:25:06,354 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/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-16 09:25:06,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:25:06,367 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:25:06,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06 WrapperNode [2024-11-16 09:25:06,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:25:06,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:25:06,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:25:06,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:25:06,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,393 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-16 09:25:06,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:25:06,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:25:06,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:25:06,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:25:06,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,411 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]. [2024-11-16 09:25:06,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:25:06,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:25:06,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:25:06,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:25:06,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (1/1) ... [2024-11-16 09:25:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:25:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:25:06,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:25:06,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:25:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:25:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-16 09:25:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-16 09:25:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-16 09:25:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-16 09:25:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:25:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 09:25:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:25:06,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:25:06,546 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:25:06,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:25:06,702 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-16 09:25:06,702 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:25:06,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:25:06,714 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:25:06,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:25:06 BoogieIcfgContainer [2024-11-16 09:25:06,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:25:06,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:25:06,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:25:06,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:25:06,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:25:06" (1/3) ... [2024-11-16 09:25:06,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bdf322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:25:06, skipping insertion in model container [2024-11-16 09:25:06,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:06" (2/3) ... [2024-11-16 09:25:06,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bdf322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:25:06, skipping insertion in model container [2024-11-16 09:25:06,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:25:06" (3/3) ... [2024-11-16 09:25:06,721 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_7.i [2024-11-16 09:25:06,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:25:06,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:25:06,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:25:06,774 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;@65f4e685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:25:06,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:25:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:25:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 09:25:06,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:25:06,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:25:06,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:25:06,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:25:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1066044952, now seen corresponding path program 1 times [2024-11-16 09:25:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:25:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087420331] [2024-11-16 09:25:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:25:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:25:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087420331] [2024-11-16 09:25:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087420331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:25:06,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:25:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:25:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17009270] [2024-11-16 09:25:06,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:25:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:25:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:25:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:25:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:25:06,938 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:25:06,952 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-16 09:25:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:25:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 09:25:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:25:06,958 INFO L225 Difference]: With dead ends: 71 [2024-11-16 09:25:06,958 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 09:25:06,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:25:06,964 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:25:06,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:25:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 09:25:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-16 09:25:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:25:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-16 09:25:06,990 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2024-11-16 09:25:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:25:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-16 09:25:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-16 09:25:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 09:25:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:25:06,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:25:06,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:25:06,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:25:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:25:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1220981901, now seen corresponding path program 1 times [2024-11-16 09:25:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:25:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901837980] [2024-11-16 09:25:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:25:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:07,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:25:07,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901837980] [2024-11-16 09:25:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901837980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:25:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:25:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 09:25:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354715506] [2024-11-16 09:25:07,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:25:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:25:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:25:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:25:07,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:25:07,188 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:25:07,214 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-16 09:25:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:25:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 09:25:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:25:07,215 INFO L225 Difference]: With dead ends: 42 [2024-11-16 09:25:07,215 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 09:25:07,215 INFO L431 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 [2024-11-16 09:25:07,216 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:25:07,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:25:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 09:25:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-16 09:25:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:25:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-16 09:25:07,221 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2024-11-16 09:25:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:25:07,221 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-16 09:25:07,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-16 09:25:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 09:25:07,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:25:07,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:25:07,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:25:07,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:25:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:25:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1266530932, now seen corresponding path program 1 times [2024-11-16 09:25:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:25:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596153937] [2024-11-16 09:25:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:25:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:07,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:25:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596153937] [2024-11-16 09:25:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596153937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:25:07,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:25:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 09:25:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395864657] [2024-11-16 09:25:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:25:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:25:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:25:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:25:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:25:07,305 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:25:07,326 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-16 09:25:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:25:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 09:25:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:25:07,327 INFO L225 Difference]: With dead ends: 40 [2024-11-16 09:25:07,327 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 09:25:07,327 INFO L431 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 [2024-11-16 09:25:07,328 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 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 [2024-11-16 09:25:07,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:25:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 09:25:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 09:25:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:25:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-16 09:25:07,337 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2024-11-16 09:25:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:25:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-16 09:25:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-16 09:25:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 09:25:07,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:25:07,339 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:25:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:25:07,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:25:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:25:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1838006099, now seen corresponding path program 1 times [2024-11-16 09:25:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:25:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561555828] [2024-11-16 09:25:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:25:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:25:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561555828] [2024-11-16 09:25:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561555828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:25:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085785366] [2024-11-16 09:25:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:25:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:25:07,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:25:07,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 09:25:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:07,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 09:25:07,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:25:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:07,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:25:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085785366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:25:07,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:25:07,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-16 09:25:07,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764742526] [2024-11-16 09:25:07,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:25:07,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:25:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:25:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:25:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:25:07,681 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:25:07,769 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-16 09:25:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:25:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 09:25:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:25:07,770 INFO L225 Difference]: With dead ends: 42 [2024-11-16 09:25:07,771 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 09:25:07,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:25:07,772 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:25:07,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 197 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:25:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 09:25:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 09:25:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:25:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-16 09:25:07,780 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 15 [2024-11-16 09:25:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:25:07,781 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-16 09:25:07,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:25:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-16 09:25:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 09:25:07,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:25:07,783 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:25:07,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 09:25:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:25:07,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:25:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:25:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1269827698, now seen corresponding path program 2 times [2024-11-16 09:25:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:25:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366820154] [2024-11-16 09:25:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:25:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:25:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:25:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:25:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:25:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366820154] [2024-11-16 09:25:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366820154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:25:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156572255] [2024-11-16 09:25:08,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 09:25:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:25:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:25:08,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:25:08,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 09:25:08,332 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 09:25:08,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 09:25:08,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 09:25:08,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:25:46,711 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-16 09:25:46,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-16 09:25:46,713 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-16 09:25:46,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 09:25:46,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:25:46,914 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-16 09:25:46,917 INFO L158 Benchmark]: Toolchain (without parser) took 40771.67ms. Allocated memory was 123.7MB in the beginning and 203.4MB in the end (delta: 79.7MB). Free memory was 56.2MB in the beginning and 74.6MB in the end (delta: -18.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,917 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 83.9MB in the end (delta: 15.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 09:25:46,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.85ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 55.9MB in the beginning and 125.4MB in the end (delta: -69.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.93ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,919 INFO L158 Benchmark]: Boogie Preprocessor took 23.13ms. Allocated memory is still 161.5MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,920 INFO L158 Benchmark]: IcfgBuilder took 296.78ms. Allocated memory is still 161.5MB. Free memory was 121.2MB in the beginning and 106.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,922 INFO L158 Benchmark]: TraceAbstraction took 40200.18ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 105.5MB in the beginning and 74.6MB in the end (delta: 30.9MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-11-16 09:25:46,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 83.9MB in the end (delta: 15.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.85ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 55.9MB in the beginning and 125.4MB in the end (delta: -69.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.93ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.13ms. Allocated memory is still 161.5MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 296.78ms. Allocated memory is still 161.5MB. Free memory was 121.2MB in the beginning and 106.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40200.18ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 105.5MB in the beginning and 74.6MB in the end (delta: 30.9MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:25:48,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:25:48,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 09:25:48,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:25:48,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:25:48,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:25:48,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:25:48,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:25:48,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:25:48,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:25:48,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:25:48,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:25:48,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:25:48,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:25:48,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:25:48,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:25:48,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:25:48,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:25:48,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:25:48,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:25:48,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:25:48,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:25:48,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:25:48,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 09:25:48,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 09:25:48,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:25:48,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 09:25:48,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:25:48,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:25:48,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:25:48,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:25:48,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:25:48,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:25:48,532 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 09:25:48,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 09:25:48,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:25:48,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:25:48,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:25:48,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:25:48,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b [2024-11-16 09:25:48,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:25:48,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:25:48,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:25:48,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:25:48,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:25:48,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i [2024-11-16 09:25:50,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:25:50,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:25:50,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i [2024-11-16 09:25:50,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b951f67eb/cde5fe223b6541038293b75b087297bd/FLAG0a765874d [2024-11-16 09:25:50,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b951f67eb/cde5fe223b6541038293b75b087297bd [2024-11-16 09:25:50,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:25:50,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:25:50,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:25:50,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:25:50,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:25:50,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c74ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50, skipping insertion in model container [2024-11-16 09:25:50,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:25:50,849 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/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-16 09:25:50,876 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/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-16 09:25:50,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:25:50,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:25:50,900 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/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-16 09:25:50,915 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/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-16 09:25:50,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:25:50,932 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:25:50,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50 WrapperNode [2024-11-16 09:25:50,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:25:50,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:25:50,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:25:50,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:25:50,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,972 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-16 09:25:50,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:25:50,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:25:50,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:25:50,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:25:50,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,998 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]. [2024-11-16 09:25:50,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:50,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:25:51,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:25:51,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:25:51,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:25:51,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (1/1) ... [2024-11-16 09:25:51,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:25:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:25:51,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:25:51,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:25:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:25:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 09:25:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 09:25:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-16 09:25:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-16 09:25:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-16 09:25:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-16 09:25:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:25:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:25:51,172 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:25:51,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:26:00,825 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 09:26:00,825 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:26:00,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:26:00,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:26:00,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:26:00 BoogieIcfgContainer [2024-11-16 09:26:00,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:26:00,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:26:00,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:26:00,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:26:00,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:25:50" (1/3) ... [2024-11-16 09:26:00,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806b912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:26:00, skipping insertion in model container [2024-11-16 09:26:00,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:25:50" (2/3) ... [2024-11-16 09:26:00,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806b912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:26:00, skipping insertion in model container [2024-11-16 09:26:00,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:26:00" (3/3) ... [2024-11-16 09:26:00,846 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_7.i [2024-11-16 09:26:00,858 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:26:00,858 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:26:00,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:26:00,913 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;@2376000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:26:00,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:26:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 09:26:00,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:00,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:00,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1066044952, now seen corresponding path program 1 times [2024-11-16 09:26:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994181513] [2024-11-16 09:26:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:26:00,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:00,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:00,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 09:26:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:26:01,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 09:26:01,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:26:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:26:01,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:26:01,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 09:26:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994181513] [2024-11-16 09:26:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994181513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:26:01,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:26:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:26:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100636273] [2024-11-16 09:26:01,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:26:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:26:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 09:26:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:26:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:26:01,040 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:26:01,058 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-16 09:26:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:26:01,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 09:26:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:26:01,078 INFO L225 Difference]: With dead ends: 71 [2024-11-16 09:26:01,078 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 09:26:01,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:26:01,085 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:26:01,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:26:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 09:26:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-16 09:26:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-16 09:26:01,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2024-11-16 09:26:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:26:01,110 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-16 09:26:01,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-16 09:26:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 09:26:01,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:01,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:01,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 09:26:01,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:01,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:01,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1220981901, now seen corresponding path program 1 times [2024-11-16 09:26:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781832001] [2024-11-16 09:26:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:26:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:01,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:01,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 09:26:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:26:01,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 09:26:01,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:26:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:26:01,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:26:01,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 09:26:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781832001] [2024-11-16 09:26:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781832001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:26:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:26:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:26:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12675603] [2024-11-16 09:26:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:26:01,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:26:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 09:26:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:26:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:26:01,542 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:26:01,623 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-16 09:26:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:26:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 09:26:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:26:01,625 INFO L225 Difference]: With dead ends: 40 [2024-11-16 09:26:01,625 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 09:26:01,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:26:01,626 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:26:01,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:26:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 09:26:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 09:26:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-16 09:26:01,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2024-11-16 09:26:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:26:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-16 09:26:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-16 09:26:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 09:26:01,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:01,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:01,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 09:26:01,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:01,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1266530932, now seen corresponding path program 1 times [2024-11-16 09:26:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386521316] [2024-11-16 09:26:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:26:01,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:01,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:01,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 09:26:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:26:01,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 09:26:01,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:26:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:26:02,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:26:02,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 09:26:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386521316] [2024-11-16 09:26:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386521316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:26:02,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:26:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 09:26:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250135658] [2024-11-16 09:26:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:26:02,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:26:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 09:26:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:26:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:26:02,112 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:26:02,300 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-16 09:26:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:26:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 09:26:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:26:02,302 INFO L225 Difference]: With dead ends: 42 [2024-11-16 09:26:02,302 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 09:26:02,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:26:02,303 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:26:02,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:26:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 09:26:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-16 09:26:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-16 09:26:02,307 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2024-11-16 09:26:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:26:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-16 09:26:02,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-16 09:26:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 09:26:02,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:02,308 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:02,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 09:26:02,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:02,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:02,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -660009838, now seen corresponding path program 1 times [2024-11-16 09:26:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982921805] [2024-11-16 09:26:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:26:02,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:02,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:02,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 09:26:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:26:02,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 09:26:02,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:26:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 09:26:02,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 09:26:02,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 09:26:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982921805] [2024-11-16 09:26:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982921805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:26:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:26:02,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 09:26:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853958810] [2024-11-16 09:26:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:26:02,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:26:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 09:26:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:26:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:26:02,829 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:26:02,983 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-16 09:26:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:26:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 09:26:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:26:02,984 INFO L225 Difference]: With dead ends: 44 [2024-11-16 09:26:02,984 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 09:26:02,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:26:02,985 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:26:02,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:26:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 09:26:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 09:26:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-16 09:26:02,989 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2024-11-16 09:26:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:26:02,990 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-16 09:26:02,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-16 09:26:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 09:26:02,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:02,990 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:02,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 09:26:03,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:03,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:03,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1838006099, now seen corresponding path program 1 times [2024-11-16 09:26:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:03,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867033726] [2024-11-16 09:26:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:26:03,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:03,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:03,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 09:26:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:26:03,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 09:26:03,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:26:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:26:04,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:26:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:26:05,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 09:26:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867033726] [2024-11-16 09:26:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867033726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:26:05,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 09:26:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 09:26:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988111714] [2024-11-16 09:26:05,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 09:26:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 09:26:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 09:26:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 09:26:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 09:26:05,046 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:26:06,460 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-16 09:26:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 09:26:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 09:26:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:26:06,461 INFO L225 Difference]: With dead ends: 49 [2024-11-16 09:26:06,461 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 09:26:06,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:26:06,462 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:26:06,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:26:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 09:26:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-16 09:26:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 09:26:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-16 09:26:06,466 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2024-11-16 09:26:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:26:06,466 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-16 09:26:06,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:26:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-16 09:26:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 09:26:06,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:26:06,467 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:26:06,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 09:26:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:06,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:26:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:26:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 770647920, now seen corresponding path program 2 times [2024-11-16 09:26:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 09:26:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389411844] [2024-11-16 09:26:06,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 09:26:06,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 09:26:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 09:26:06,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 09:26:06,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 09:26:08,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 09:26:08,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 09:26:08,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 09:26:08,079 INFO L278 TraceCheckSpWp]: Computing forward predicates...