./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:57:44,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:57:44,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 21:57:44,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:57:44,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:57:44,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:57:44,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:57:44,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:57:44,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:57:44,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:57:44,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:57:44,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:57:44,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:57:44,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:57:44,749 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:57:44,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:57:44,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:57:44,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:57:44,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:57:44,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:57:44,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:57:44,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:57:44,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:57:44,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:57:44,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:57:44,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:57:44,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:57:44,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:57:44,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:57:44,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:57:44,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:57:44,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:57:44,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:57:44,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:57:44,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:57:44,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:57:44,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:57:44,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:57:44,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:57:44,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:57:44,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:57:44,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:57:44,761 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2024-10-10 21:57:44,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:57:44,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:57:44,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:57:44,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:57:44,995 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:57:44,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2024-10-10 21:57:46,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:57:46,406 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:57:46,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2024-10-10 21:57:46,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/665168f26/c2ed7ecc424e494091be76f53b0bee6d/FLAG0cc337c4e [2024-10-10 21:57:46,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/665168f26/c2ed7ecc424e494091be76f53b0bee6d [2024-10-10 21:57:46,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:57:46,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:57:46,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:57:46,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:57:46,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:57:46,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:57:46" (1/1) ... [2024-10-10 21:57:46,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fb9fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:46, skipping insertion in model container [2024-10-10 21:57:46,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:57:46" (1/1) ... [2024-10-10 21:57:46,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:57:46,969 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2024-10-10 21:57:46,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:57:46,978 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:57:47,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2024-10-10 21:57:47,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:57:47,021 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:57:47,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47 WrapperNode [2024-10-10 21:57:47,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:57:47,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:57:47,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:57:47,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:57:47,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,063 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-10-10 21:57:47,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:57:47,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:57:47,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:57:47,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:57:47,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,093 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2024-10-10 21:57:47,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:57:47,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:57:47,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:57:47,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:57:47,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (1/1) ... [2024-10-10 21:57:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:57:47,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:57:47,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 21:57:47,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 21:57:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:57:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-10-10 21:57:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-10-10 21:57:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:57:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:57:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 21:57:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:57:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:57:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 21:57:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:57:47,257 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:57:47,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:57:47,370 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-10 21:57:47,370 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:57:47,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:57:47,405 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 21:57:47,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:57:47 BoogieIcfgContainer [2024-10-10 21:57:47,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:57:47,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:57:47,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:57:47,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:57:47,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:57:46" (1/3) ... [2024-10-10 21:57:47,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf05cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:57:47, skipping insertion in model container [2024-10-10 21:57:47,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:57:47" (2/3) ... [2024-10-10 21:57:47,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf05cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:57:47, skipping insertion in model container [2024-10-10 21:57:47,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:57:47" (3/3) ... [2024-10-10 21:57:47,413 INFO L112 eAbstractionObserver]: Analyzing ICFG max.i [2024-10-10 21:57:47,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:57:47,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:57:47,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:57:47,482 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;@6df06369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:57:47,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:57:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:57:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 21:57:47,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:47,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:47,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1629596084, now seen corresponding path program 1 times [2024-10-10 21:57:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461504032] [2024-10-10 21:57:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:57:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:57:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 21:57:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461504032] [2024-10-10 21:57:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461504032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:57:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:57:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 21:57:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939442521] [2024-10-10 21:57:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:57:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 21:57:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 21:57:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 21:57:47,722 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:57:47,758 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2024-10-10 21:57:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 21:57:47,761 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-10 21:57:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:57:47,766 INFO L225 Difference]: With dead ends: 41 [2024-10-10 21:57:47,766 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 21:57:47,769 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-10-10 21:57:47,773 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:57:47,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:57:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 21:57:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-10 21:57:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:57:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-10 21:57:47,805 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 24 [2024-10-10 21:57:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:57:47,805 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-10 21:57:47,805 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-10 21:57:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 21:57:47,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:47,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:47,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 21:57:47,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:47,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash 259492283, now seen corresponding path program 1 times [2024-10-10 21:57:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127816675] [2024-10-10 21:57:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:47,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:57:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:57:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:57:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127816675] [2024-10-10 21:57:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127816675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:57:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276480450] [2024-10-10 21:57:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:57:48,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:57:48,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 21:57:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:57:48,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:57:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:57:48,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:57:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276480450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:57:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:57:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-10 21:57:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641673309] [2024-10-10 21:57:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:57:48,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:57:48,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:57:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 21:57:48,200 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:57:48,244 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-10 21:57:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:57:48,244 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-10 21:57:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:57:48,245 INFO L225 Difference]: With dead ends: 38 [2024-10-10 21:57:48,245 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 21:57:48,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 21:57:48,246 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:57:48,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:57:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 21:57:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-10 21:57:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:57:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-10 21:57:48,255 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2024-10-10 21:57:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:57:48,255 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-10 21:57:48,255 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-10 21:57:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 21:57:48,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:48,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:48,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 21:57:48,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:48,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:48,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:48,458 INFO L85 PathProgramCache]: Analyzing trace with hash 932436953, now seen corresponding path program 1 times [2024-10-10 21:57:48,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:48,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309176447] [2024-10-10 21:57:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:57:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 21:57:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 21:57:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:48,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309176447] [2024-10-10 21:57:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309176447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:57:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:57:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 21:57:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745610641] [2024-10-10 21:57:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:57:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:57:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:57:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:57:48,580 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:57:48,615 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-10 21:57:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:57:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-10 21:57:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:57:48,617 INFO L225 Difference]: With dead ends: 34 [2024-10-10 21:57:48,617 INFO L226 Difference]: Without dead ends: 21 [2024-10-10 21:57:48,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:57:48,618 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:57:48,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:57:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-10 21:57:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-10 21:57:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:57:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-10 21:57:48,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 33 [2024-10-10 21:57:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:57:48,627 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-10 21:57:48,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:57:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-10 21:57:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 21:57:48,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:48,628 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:48,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 21:57:48,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:48,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2071615593, now seen corresponding path program 1 times [2024-10-10 21:57:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679115887] [2024-10-10 21:57:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:57:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 21:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:57:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679115887] [2024-10-10 21:57:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679115887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:57:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133913928] [2024-10-10 21:57:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:48,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:57:48,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:57:48,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 21:57:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:48,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:57:48,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:57:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 21:57:48,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:57:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:57:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133913928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:57:48,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:57:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-10-10 21:57:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479609869] [2024-10-10 21:57:48,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:57:48,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 21:57:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 21:57:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:57:48,951 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:57:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:57:49,018 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-10-10 21:57:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:57:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-10-10 21:57:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:57:49,019 INFO L225 Difference]: With dead ends: 44 [2024-10-10 21:57:49,019 INFO L226 Difference]: Without dead ends: 26 [2024-10-10 21:57:49,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-10 21:57:49,022 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:57:49,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:57:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-10 21:57:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-10 21:57:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:57:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-10 21:57:49,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 34 [2024-10-10 21:57:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:57:49,030 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-10 21:57:49,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:57:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-10 21:57:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:57:49,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:49,032 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:49,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 21:57:49,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:49,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:49,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 918466193, now seen corresponding path program 2 times [2024-10-10 21:57:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:49,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106601317] [2024-10-10 21:57:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:57:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:57:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 21:57:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:50,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106601317] [2024-10-10 21:57:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106601317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:57:50,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747402206] [2024-10-10 21:57:50,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:57:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:57:50,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:57:50,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 21:57:50,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:57:50,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:57:50,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-10 21:57:50,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:57:50,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-10-10 21:57:50,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 21:57:50,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-10-10 21:57:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 21:57:50,814 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-10 21:57:50,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 35 [2024-10-10 21:57:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:57:51,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:57:51,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747402206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:57:51,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 21:57:51,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2024-10-10 21:57:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108539980] [2024-10-10 21:57:51,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 21:57:51,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-10 21:57:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-10 21:57:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2024-10-10 21:57:51,618 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 32 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-10 21:57:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:57:52,589 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-10-10 21:57:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-10 21:57:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2024-10-10 21:57:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:57:52,592 INFO L225 Difference]: With dead ends: 104 [2024-10-10 21:57:52,592 INFO L226 Difference]: Without dead ends: 69 [2024-10-10 21:57:52,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2024-10-10 21:57:52,594 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 21:57:52,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 127 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 21:57:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-10 21:57:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2024-10-10 21:57:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-10 21:57:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-10-10 21:57:52,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 43 [2024-10-10 21:57:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:57:52,603 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-10 21:57:52,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-10 21:57:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-10-10 21:57:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:57:52,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:57:52,604 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:57:52,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 21:57:52,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:52,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:57:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:57:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -886972141, now seen corresponding path program 1 times [2024-10-10 21:57:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:57:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852178206] [2024-10-10 21:57:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:57:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:57:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:57:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:57:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 21:57:55,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:57:55,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852178206] [2024-10-10 21:57:55,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852178206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:57:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131136118] [2024-10-10 21:57:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:57:55,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:57:55,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:57:55,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:57:55,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 21:57:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:57:55,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-10 21:57:55,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:57:55,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-10-10 21:57:55,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2024-10-10 21:57:55,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-10 21:57:56,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 74 [2024-10-10 21:57:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 21:57:56,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:57:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-10-10 21:57:56,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-10-10 21:57:56,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-10 21:57:56,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2024-10-10 21:57:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 61 [2024-10-10 21:57:57,703 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-10 21:57:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2024-10-10 21:57:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:57:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131136118] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:57:57,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:57:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 25] total 67 [2024-10-10 21:57:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612924327] [2024-10-10 21:57:57,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:57:57,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-10 21:57:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:57:57,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-10 21:57:57,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4146, Unknown=0, NotChecked=0, Total=4422 [2024-10-10 21:57:57,854 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 67 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 60 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-10 21:58:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:00,154 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2024-10-10 21:58:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-10 21:58:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 60 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 43 [2024-10-10 21:58:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:00,157 INFO L225 Difference]: With dead ends: 169 [2024-10-10 21:58:00,158 INFO L226 Difference]: Without dead ends: 165 [2024-10-10 21:58:00,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=764, Invalid=9742, Unknown=0, NotChecked=0, Total=10506 [2024-10-10 21:58:00,161 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:00,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 132 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 21:58:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-10 21:58:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 94. [2024-10-10 21:58:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 81 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2024-10-10 21:58:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-10 21:58:00,177 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 43 [2024-10-10 21:58:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:00,180 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-10 21:58:00,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 60 states have internal predecessors, (92), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-10 21:58:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-10 21:58:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:58:00,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:00,181 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:00,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 21:58:00,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-10 21:58:00,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:00,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1696318767, now seen corresponding path program 2 times [2024-10-10 21:58:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866957554] [2024-10-10 21:58:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:58:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866957554] [2024-10-10 21:58:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866957554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336694482] [2024-10-10 21:58:01,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:01,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:01,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:01,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 21:58:01,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:01,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:01,512 WARN L253 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-10 21:58:01,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:01,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 33 [2024-10-10 21:58:02,604 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-10 21:58:02,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 135 treesize of output 120 [2024-10-10 21:58:02,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-10 21:58:03,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 21:58:03,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 98 [2024-10-10 21:58:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 21:58:03,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:14,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 371 [2024-10-10 21:58:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 201 [2024-10-10 21:58:17,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 21:58:17,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 264 [2024-10-10 21:58:17,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-10-10 21:58:17,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 21:58:17,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 144 [2024-10-10 21:58:17,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 256 [2024-10-10 21:58:17,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 21:58:17,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 84 [2024-10-10 21:58:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 21:58:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336694482] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:17,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 34, 32] total 82 [2024-10-10 21:58:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977309337] [2024-10-10 21:58:17,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-10-10 21:58:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-10-10 21:58:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=6225, Unknown=3, NotChecked=0, Total=6642 [2024-10-10 21:58:17,999 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 82 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 73 states have internal predecessors, (104), 8 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-10 21:58:24,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:28,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:38,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:42,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:48,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:52,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:58:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:52,217 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2024-10-10 21:58:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-10-10 21:58:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 73 states have internal predecessors, (104), 8 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 43 [2024-10-10 21:58:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:52,220 INFO L225 Difference]: With dead ends: 286 [2024-10-10 21:58:52,221 INFO L226 Difference]: Without dead ends: 241 [2024-10-10 21:58:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10860 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=2701, Invalid=32078, Unknown=3, NotChecked=0, Total=34782 [2024-10-10 21:58:52,227 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 343 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 3276 mSolverCounterSat, 168 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3276 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:52,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 197 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3276 Invalid, 6 Unknown, 0 Unchecked, 24.0s Time] [2024-10-10 21:58:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-10 21:58:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 130. [2024-10-10 21:58:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 115 states have internal predecessors, (146), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (23), 9 states have call predecessors, (23), 10 states have call successors, (23) [2024-10-10 21:58:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-10-10 21:58:52,258 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 43 [2024-10-10 21:58:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-10-10 21:58:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 73 states have internal predecessors, (104), 8 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-10 21:58:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-10-10 21:58:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:58:52,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:52,260 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:52,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:52,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:52,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:52,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash -995254189, now seen corresponding path program 3 times [2024-10-10 21:58:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:52,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080123532] [2024-10-10 21:58:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 48 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 21:58:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080123532] [2024-10-10 21:58:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080123532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336014632] [2024-10-10 21:58:53,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:53,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:53,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:53,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 21:58:53,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-10 21:58:53,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:53,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-10 21:58:53,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:53,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-10 21:58:53,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-10 21:58:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 21:58:53,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336014632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:54,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 21:58:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2024-10-10 21:58:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630422544] [2024-10-10 21:58:54,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:54,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-10 21:58:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-10 21:58:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2024-10-10 21:58:54,037 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-10 21:58:58,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:02,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:06,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:13,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:59:14,027 INFO L93 Difference]: Finished difference Result 566 states and 801 transitions. [2024-10-10 21:59:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-10 21:59:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-10 21:59:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:59:14,032 INFO L225 Difference]: With dead ends: 566 [2024-10-10 21:59:14,032 INFO L226 Difference]: Without dead ends: 482 [2024-10-10 21:59:14,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=547, Invalid=5153, Unknown=0, NotChecked=0, Total=5700 [2024-10-10 21:59:14,038 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 101 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 30 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-10-10 21:59:14,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 153 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1771 Invalid, 7 Unknown, 0 Unchecked, 18.9s Time] [2024-10-10 21:59:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-10 21:59:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 350. [2024-10-10 21:59:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 300 states have (on average 1.33) internal successors, (399), 319 states have internal predecessors, (399), 22 states have call successors, (22), 14 states have call predecessors, (22), 27 states have return successors, (69), 16 states have call predecessors, (69), 22 states have call successors, (69) [2024-10-10 21:59:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2024-10-10 21:59:14,116 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 43 [2024-10-10 21:59:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:59:14,117 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2024-10-10 21:59:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-10 21:59:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2024-10-10 21:59:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:59:14,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:59:14,135 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:59:14,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 21:59:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-10 21:59:14,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:59:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:59:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -734885935, now seen corresponding path program 4 times [2024-10-10 21:59:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:59:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148294815] [2024-10-10 21:59:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:59:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:59:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:59:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:59:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:59:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:59:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:59:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:59:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:59:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:59:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:59:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148294815] [2024-10-10 21:59:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148294815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:59:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829244679] [2024-10-10 21:59:15,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 21:59:15,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:59:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:59:15,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:59:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 21:59:16,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 21:59:16,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:59:16,101 WARN L253 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-10 21:59:16,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:59:16,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 21:59:16,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 40 [2024-10-10 21:59:17,061 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-10 21:59:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 78 [2024-10-10 21:59:17,346 INFO L349 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2024-10-10 21:59:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 98 [2024-10-10 21:59:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2024-10-10 21:59:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 21:59:17,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:59:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829244679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:59:18,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 21:59:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2024-10-10 21:59:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234311406] [2024-10-10 21:59:18,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 21:59:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-10 21:59:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:59:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-10 21:59:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3778, Unknown=0, NotChecked=0, Total=4032 [2024-10-10 21:59:18,762 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 53 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 46 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)