./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/rangesum.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/rangesum.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 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:58:30,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:58:30,397 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:58:30,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:58:30,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:58:30,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:58:30,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:58:30,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:58:30,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:58:30,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:58:30,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:58:30,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:58:30,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:58:30,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:58:30,447 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:58:30,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:58:30,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:58:30,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:58:30,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:58:30,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:58:30,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:58:30,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:58:30,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:58:30,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:58:30,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:58:30,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:58:30,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:58:30,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:58:30,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:58:30,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:58:30,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:58:30,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:58:30,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:30,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:58:30,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:58:30,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:58:30,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:58:30,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:58:30,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:58:30,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:58:30,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:58:30,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:58:30,461 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 -> 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 [2024-10-10 21:58:30,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:58:30,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:58:30,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:58:30,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:58:30,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:58:30,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2024-10-10 21:58:32,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:58:32,382 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:58:32,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2024-10-10 21:58:32,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8afe2a47/ac24b6de30854b08801cc6480c9337c3/FLAG38b8585e8 [2024-10-10 21:58:32,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8afe2a47/ac24b6de30854b08801cc6480c9337c3 [2024-10-10 21:58:32,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:58:32,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:58:32,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:32,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:58:32,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:58:32,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60dbb7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32, skipping insertion in model container [2024-10-10 21:58:32,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:58:32,621 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/rangesum.i[1544,1557] [2024-10-10 21:58:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:32,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:58:32,658 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/rangesum.i[1544,1557] [2024-10-10 21:58:32,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:32,674 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:58:32,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32 WrapperNode [2024-10-10 21:58:32,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:32,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:32,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:58:32,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:58:32,682 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:58:32" (1/1) ... [2024-10-10 21:58:32,691 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:58:32" (1/1) ... [2024-10-10 21:58:32,716 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-10 21:58:32,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:32,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:58:32,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:58:32,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:58:32,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,774 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-10 21:58:32,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:58:32,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:58:32,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:58:32,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:58:32,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (1/1) ... [2024-10-10 21:58:32,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:32,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:32,839 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:58:32,846 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:58:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:58:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:58:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:58:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:58:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:58:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:58:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:58:32,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:58:32,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:58:32,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:58:32,899 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-10-10 21:58:32,899 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-10-10 21:58:32,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:58:32,965 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:58:32,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:58:33,176 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-10 21:58:33,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:58:33,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:58:33,203 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 21:58:33,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:33 BoogieIcfgContainer [2024-10-10 21:58:33,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:58:33,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:58:33,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:58:33,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:58:33,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:58:32" (1/3) ... [2024-10-10 21:58:33,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903b13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:33, skipping insertion in model container [2024-10-10 21:58:33,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:32" (2/3) ... [2024-10-10 21:58:33,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903b13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:33, skipping insertion in model container [2024-10-10 21:58:33,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:33" (3/3) ... [2024-10-10 21:58:33,214 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum.i [2024-10-10 21:58:33,234 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:58:33,234 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:58:33,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:58:33,297 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;@777b9183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:58:33,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:58:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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:58:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 21:58:33,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:33,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:33,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 538737317, now seen corresponding path program 1 times [2024-10-10 21:58:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309102563] [2024-10-10 21:58:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 21:58:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:33,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:33,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309102563] [2024-10-10 21:58:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309102563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:33,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:33,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 21:58:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762269780] [2024-10-10 21:58:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:33,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 21:58:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 21:58:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 21:58:33,669 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:33,706 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2024-10-10 21:58:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 21:58:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-10 21:58:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:33,715 INFO L225 Difference]: With dead ends: 47 [2024-10-10 21:58:33,716 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 21:58:33,719 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:58:33,722 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:33,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 21:58:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 21:58:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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:58:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-10 21:58:33,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 29 [2024-10-10 21:58:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:33,761 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-10 21:58:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-10 21:58:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 21:58:33,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:33,763 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:33,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 21:58:33,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:33,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 596589422, now seen corresponding path program 1 times [2024-10-10 21:58:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439916734] [2024-10-10 21:58:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 21:58:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439916734] [2024-10-10 21:58:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439916734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:58:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804450842] [2024-10-10 21:58:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:58:33,982 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:34,020 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-10 21:58:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-10 21:58:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:34,022 INFO L225 Difference]: With dead ends: 42 [2024-10-10 21:58:34,022 INFO L226 Difference]: Without dead ends: 23 [2024-10-10 21:58:34,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:58:34,025 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:34,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-10 21:58:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-10 21:58:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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:58:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-10 21:58:34,035 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 29 [2024-10-10 21:58:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:34,036 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-10 21:58:34,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-10 21:58:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 21:58:34,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:34,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:34,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 21:58:34,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash 743042130, now seen corresponding path program 1 times [2024-10-10 21:58:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:34,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707522070] [2024-10-10 21:58:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-10 21:58:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 21:58:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-10 21:58:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:58:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707522070] [2024-10-10 21:58:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707522070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547093357] [2024-10-10 21:58:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:34,212 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:58:34,213 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:58:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:34,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 21:58:34,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547093357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:34,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:34,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-10 21:58:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964522847] [2024-10-10 21:58:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:34,394 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:58:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:34,430 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-10-10 21:58:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 30 [2024-10-10 21:58:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:34,431 INFO L225 Difference]: With dead ends: 44 [2024-10-10 21:58:34,431 INFO L226 Difference]: Without dead ends: 27 [2024-10-10 21:58:34,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:34,433 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:34,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-10 21:58:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-10 21:58:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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:58:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-10 21:58:34,445 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2024-10-10 21:58:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:34,446 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-10 21:58:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:58:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-10 21:58:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 21:58:34,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:34,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:34,466 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:58:34,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:34,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:34,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 241166801, now seen corresponding path program 1 times [2024-10-10 21:58:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:34,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144948550] [2024-10-10 21:58:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-10 21:58:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 21:58:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-10 21:58:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:58:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144948550] [2024-10-10 21:58:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144948550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171971678] [2024-10-10 21:58:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:34,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:34,769 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:58:34,772 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:58:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:58:34,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:34,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171971678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:34,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-10 21:58:34,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280332411] [2024-10-10 21:58:34,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:34,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 21:58:34,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 21:58:34,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 21:58:34,965 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:35,053 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-10-10 21:58:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2024-10-10 21:58:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:35,054 INFO L225 Difference]: With dead ends: 54 [2024-10-10 21:58:35,054 INFO L226 Difference]: Without dead ends: 31 [2024-10-10 21:58:35,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:35,056 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:35,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 61 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-10 21:58:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-10 21:58:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:58:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-10-10 21:58:35,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 30 [2024-10-10 21:58:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:35,062 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-10 21:58:35,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-10-10 21:58:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 21:58:35,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:35,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:35,084 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:58:35,265 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:58:35,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 843711203, now seen corresponding path program 1 times [2024-10-10 21:58:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552145703] [2024-10-10 21:58:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 21:58:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:58:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 21:58:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 21:58:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552145703] [2024-10-10 21:58:35,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552145703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:35,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:35,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 21:58:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297159595] [2024-10-10 21:58:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:35,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:58:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:35,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:58:35,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:35,396 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:58:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:35,450 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-10 21:58:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:58:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 40 [2024-10-10 21:58:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:35,451 INFO L225 Difference]: With dead ends: 50 [2024-10-10 21:58:35,451 INFO L226 Difference]: Without dead ends: 31 [2024-10-10 21:58:35,452 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:58:35,453 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:35,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-10 21:58:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-10 21:58:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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:58:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-10 21:58:35,465 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2024-10-10 21:58:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-10 21:58:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:58:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-10-10 21:58:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 21:58:35,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:35,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:35,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 21:58:35,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:35,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash -431388978, now seen corresponding path program 1 times [2024-10-10 21:58:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091056286] [2024-10-10 21:58:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 21:58:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:58:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-10 21:58:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091056286] [2024-10-10 21:58:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091056286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 21:58:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189457223] [2024-10-10 21:58:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 21:58:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 21:58:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 21:58:35,795 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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:58:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:35,905 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-10-10 21:58:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 21:58:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 41 [2024-10-10 21:58:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:35,909 INFO L225 Difference]: With dead ends: 53 [2024-10-10 21:58:35,910 INFO L226 Difference]: Without dead ends: 49 [2024-10-10 21:58:35,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-10 21:58:35,912 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:35,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 170 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-10 21:58:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2024-10-10 21:58:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-10 21:58:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-10-10 21:58:35,924 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 41 [2024-10-10 21:58:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-10-10 21:58:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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:58:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-10-10 21:58:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 21:58:35,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:35,927 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:35,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 21:58:35,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1018748469, now seen corresponding path program 1 times [2024-10-10 21:58:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032693132] [2024-10-10 21:58:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 21:58:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 21:58:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-10 21:58:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 21:58:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032693132] [2024-10-10 21:58:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032693132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052021928] [2024-10-10 21:58:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:36,072 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:58:36,075 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:58:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:58:36,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:58:36,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 21:58:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052021928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:36,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-10-10 21:58:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030603752] [2024-10-10 21:58:36,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:36,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 21:58:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 21:58:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:36,331 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:58:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:36,435 INFO L93 Difference]: Finished difference Result 77 states and 113 transitions. [2024-10-10 21:58:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:36,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-10-10 21:58:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:36,436 INFO L225 Difference]: With dead ends: 77 [2024-10-10 21:58:36,436 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 21:58:36,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 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:58:36,438 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:36,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 21:58:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-10 21:58:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-10 21:58:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-10-10 21:58:36,446 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 44 [2024-10-10 21:58:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:36,446 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-10-10 21:58:36,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:58:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-10-10 21:58:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 21:58:36,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:36,448 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:36,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 21:58:36,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1731959157, now seen corresponding path program 2 times [2024-10-10 21:58:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102652464] [2024-10-10 21:58:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 21:58:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 21:58:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-10 21:58:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 5 proven. 64 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102652464] [2024-10-10 21:58:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102652464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:36,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799770063] [2024-10-10 21:58:36,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:36,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:36,827 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:58:36,828 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:58:36,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:36,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:36,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 21:58:36,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 21:58:36,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799770063] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:37,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:37,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-10-10 21:58:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126188473] [2024-10-10 21:58:37,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 21:58:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 21:58:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-10 21:58:37,145 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 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:58:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:37,337 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2024-10-10 21:58:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-10 21:58:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 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 53 [2024-10-10 21:58:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:37,339 INFO L225 Difference]: With dead ends: 119 [2024-10-10 21:58:37,340 INFO L226 Difference]: Without dead ends: 63 [2024-10-10 21:58:37,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-10-10 21:58:37,344 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:37,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-10 21:58:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-10 21:58:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-10 21:58:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-10-10 21:58:37,362 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 53 [2024-10-10 21:58:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:37,363 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-10-10 21:58:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 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:58:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-10-10 21:58:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 21:58:37,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:37,365 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:37,384 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:37,566 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,SelfDestructingSolverStorable7 [2024-10-10 21:58:37,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:37,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2089571473, now seen corresponding path program 3 times [2024-10-10 21:58:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:37,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654909261] [2024-10-10 21:58:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 21:58:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 21:58:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-10 21:58:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-10 21:58:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654909261] [2024-10-10 21:58:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654909261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643828402] [2024-10-10 21:58:37,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:37,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:37,780 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:37,781 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:37,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-10 21:58:37,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:37,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 21:58:37,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-10 21:58:37,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-10 21:58:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643828402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:38,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2024-10-10 21:58:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907578803] [2024-10-10 21:58:38,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:38,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 21:58:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 21:58:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-10 21:58:38,064 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:38,206 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-10-10 21:58:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-10 21:58:38,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-10 21:58:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:38,208 INFO L225 Difference]: With dead ends: 109 [2024-10-10 21:58:38,208 INFO L226 Difference]: Without dead ends: 59 [2024-10-10 21:58:38,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-10 21:58:38,209 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:38,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-10 21:58:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2024-10-10 21:58:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-10 21:58:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-10-10 21:58:38,222 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 54 [2024-10-10 21:58:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:38,223 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-10-10 21:58:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-10-10 21:58:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-10 21:58:38,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:38,226 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:38,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 21:58:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:38,429 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -975500740, now seen corresponding path program 1 times [2024-10-10 21:58:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130169749] [2024-10-10 21:58:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 21:58:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095480867] [2024-10-10 21:58:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:38,528 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:38,529 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:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 21:58:38,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 21:58:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 21:58:38,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 21:58:38,711 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 21:58:38,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 21:58:38,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 21:58:38,914 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,SelfDestructingSolverStorable9 [2024-10-10 21:58:38,917 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:38,974 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 21:58:38,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 09:58:38 BoogieIcfgContainer [2024-10-10 21:58:38,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 21:58:38,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 21:58:38,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 21:58:38,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 21:58:38,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:33" (3/4) ... [2024-10-10 21:58:38,978 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 21:58:39,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 21:58:39,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 21:58:39,056 INFO L158 Benchmark]: Toolchain (without parser) took 6648.61ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 100.9MB in the beginning and 151.0MB in the end (delta: -50.1MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,056 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 21:58:39,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.79ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 88.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 151.0MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,057 INFO L158 Benchmark]: Boogie Preprocessor took 80.45ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,058 INFO L158 Benchmark]: RCFGBuilder took 404.72ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 113.3MB in the end (delta: -28.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,058 INFO L158 Benchmark]: TraceAbstraction took 5770.59ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 112.2MB in the beginning and 51.5MB in the end (delta: 60.7MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,058 INFO L158 Benchmark]: Witness Printer took 79.18ms. Allocated memory is still 182.5MB. Free memory was 51.5MB in the beginning and 151.0MB in the end (delta: -99.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 21:58:39,060 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.79ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 88.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 151.0MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.45ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 404.72ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 113.3MB in the end (delta: -28.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5770.59ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 112.2MB in the beginning and 51.5MB in the end (delta: 60.7MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * Witness Printer took 79.18ms. Allocated memory is still 182.5MB. Free memory was 51.5MB in the beginning and 151.0MB in the end (delta: -99.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [N=3, i=0, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=1, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=2, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=3, x={3:0}] [L18] COND FALSE !(i < N) VAL [N=3, x={3:0}] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=1, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=1, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=1, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3] [L55] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=1, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=1, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=1, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, ret=1, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [N=3, i=0, ret2=1, ret=1, temp=0, x={3:0}] [L57] COND TRUE i N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=0, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=0, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [N=3, ret2=1, ret=1, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3, x={3:0}] [L64] reach_error() VAL [N=3, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 199 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 427 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 683 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 1314 SizeOfPredicates, 3 NumberOfNonLiveVariables, 860 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 756/957 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-10 21:58:39,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE