./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms3.c --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/array-fpi/ms3.c -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 b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:23:16,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:23:16,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:23:16,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:23:16,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:23:16,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:23:16,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:23:16,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:23:16,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:23:16,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:23:16,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:23:16,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:23:16,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:23:16,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:23:16,533 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:23:16,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:23:16,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:23:16,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:23:16,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:23:16,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:23:16,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:23:16,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:23:16,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:23:16,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:23:16,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:23:16,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:23:16,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:23:16,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:23:16,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:23:16,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:23:16,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:23:16,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:23:16,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:23:16,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:23:16,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:23:16,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:23:16,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:23:16,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:23:16,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:23:16,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:23:16,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:23:16,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:23:16,542 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 -> b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 [2024-10-10 22:23:16,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:23:16,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:23:16,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:23:16,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:23:16,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:23:16,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms3.c [2024-10-10 22:23:18,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:23:18,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:23:18,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms3.c [2024-10-10 22:23:18,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8aeed868d/01867c97ba1e4ac298f0db1bf6d8f9b7/FLAG5c704202a [2024-10-10 22:23:18,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8aeed868d/01867c97ba1e4ac298f0db1bf6d8f9b7 [2024-10-10 22:23:18,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:23:18,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:23:18,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:23:18,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:23:18,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:23:18,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:23:18" (1/1) ... [2024-10-10 22:23:18,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:18, skipping insertion in model container [2024-10-10 22:23:18,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:23:18" (1/1) ... [2024-10-10 22:23:18,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:23:18,971 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/array-fpi/ms3.c[586,599] [2024-10-10 22:23:18,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:23:18,995 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:23:19,004 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/array-fpi/ms3.c[586,599] [2024-10-10 22:23:19,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:23:19,027 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:23:19,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19 WrapperNode [2024-10-10 22:23:19,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:23:19,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:23:19,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:23:19,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:23:19,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,062 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-10-10 22:23:19,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:23:19,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:23:19,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:23:19,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:23:19,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,090 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 4, 2]. 43 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0]. The 3 writes are split as follows [0, 0, 2, 1]. [2024-10-10 22:23:19,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:23:19,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:23:19,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:23:19,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:23:19,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (1/1) ... [2024-10-10 22:23:19,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:23:19,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:19,135 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 22:23:19,137 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 22:23:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:23:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:23:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:23:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:23:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-10 22:23:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-10 22:23:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:23:19,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:23:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:23:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:23:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:23:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-10 22:23:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:23:19,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:23:19,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:23:19,416 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-10 22:23:19,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:23:19,447 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:23:19,448 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:23:19,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:23:19 BoogieIcfgContainer [2024-10-10 22:23:19,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:23:19,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:23:19,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:23:19,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:23:19,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:23:18" (1/3) ... [2024-10-10 22:23:19,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a527ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:23:19, skipping insertion in model container [2024-10-10 22:23:19,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:23:19" (2/3) ... [2024-10-10 22:23:19,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a527ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:23:19, skipping insertion in model container [2024-10-10 22:23:19,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:23:19" (3/3) ... [2024-10-10 22:23:19,461 INFO L112 eAbstractionObserver]: Analyzing ICFG ms3.c [2024-10-10 22:23:19,477 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:23:19,477 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:23:19,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:23:19,550 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;@417411d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:23:19,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:23:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:23:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:19,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:19,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:19,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -475281051, now seen corresponding path program 1 times [2024-10-10 22:23:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948319235] [2024-10-10 22:23:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948319235] [2024-10-10 22:23:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948319235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:23:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:23:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:23:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571806714] [2024-10-10 22:23:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:23:19,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:23:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:19,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:23:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:23:19,740 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:19,761 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2024-10-10 22:23:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:23:19,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-10 22:23:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:19,774 INFO L225 Difference]: With dead ends: 29 [2024-10-10 22:23:19,774 INFO L226 Difference]: Without dead ends: 13 [2024-10-10 22:23:19,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:23:19,782 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:19,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:23:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-10 22:23:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-10 22:23:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-10 22:23:19,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-10-10 22:23:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:19,807 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-10 22:23:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-10-10 22:23:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:23:19,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:19,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:19,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:23:19,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1284627677, now seen corresponding path program 1 times [2024-10-10 22:23:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930018720] [2024-10-10 22:23:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930018720] [2024-10-10 22:23:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930018720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:23:19,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:23:19,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:23:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951236479] [2024-10-10 22:23:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:23:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:23:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:23:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:23:19,970 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:20,025 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-10 22:23:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:23:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-10 22:23:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:20,026 INFO L225 Difference]: With dead ends: 25 [2024-10-10 22:23:20,027 INFO L226 Difference]: Without dead ends: 17 [2024-10-10 22:23:20,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 22:23:20,029 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:20,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:23:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-10 22:23:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-10 22:23:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-10 22:23:20,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-10-10 22:23:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:20,037 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-10 22:23:20,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-10 22:23:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:23:20,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:20,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:23:20,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:20,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -254677122, now seen corresponding path program 1 times [2024-10-10 22:23:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:20,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376034497] [2024-10-10 22:23:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:23:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376034497] [2024-10-10 22:23:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376034497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:23:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:23:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:23:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046708810] [2024-10-10 22:23:20,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:23:20,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:23:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:23:20,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:23:20,377 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:20,434 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-10 22:23:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:23:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-10 22:23:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:20,436 INFO L225 Difference]: With dead ends: 23 [2024-10-10 22:23:20,436 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 22:23:20,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:23:20,438 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:20,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:23:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 22:23:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-10 22:23:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-10 22:23:20,449 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-10-10 22:23:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:20,449 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-10 22:23:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-10 22:23:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:23:20,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:20,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:23:20,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash -577618426, now seen corresponding path program 1 times [2024-10-10 22:23:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761177497] [2024-10-10 22:23:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:20,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:20,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761177497] [2024-10-10 22:23:20,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761177497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:23:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131405925] [2024-10-10 22:23:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:20,607 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 22:23:20,608 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 22:23:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:20,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:23:20,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:23:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:20,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:23:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131405925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:23:20,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:23:20,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-10 22:23:20,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154041032] [2024-10-10 22:23:20,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:23:20,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:23:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:20,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:23:20,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:23:20,903 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:20,970 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-10 22:23:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:23:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-10 22:23:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:20,971 INFO L225 Difference]: With dead ends: 35 [2024-10-10 22:23:20,971 INFO L226 Difference]: Without dead ends: 21 [2024-10-10 22:23:20,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:23:20,973 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:20,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:23:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-10 22:23:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-10 22:23:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-10 22:23:20,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2024-10-10 22:23:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-10 22:23:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-10 22:23:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:23:20,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:20,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:21,001 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 22:23:21,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:21,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1060569855, now seen corresponding path program 2 times [2024-10-10 22:23:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049166247] [2024-10-10 22:23:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049166247] [2024-10-10 22:23:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049166247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:23:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345998690] [2024-10-10 22:23:21,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:23:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:21,908 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 22:23:21,909 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 22:23:21,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:23:21,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:23:21,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-10 22:23:21,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:23:22,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-10 22:23:22,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-10 22:23:22,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-10 22:23:22,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-10 22:23:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:22,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:23:22,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-10-10 22:23:22,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:22,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2024-10-10 22:23:22,551 INFO L349 Elim1Store]: treesize reduction 32, result has 20.0 percent of original size [2024-10-10 22:23:22,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2024-10-10 22:23:22,574 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-10 22:23:22,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-10 22:23:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345998690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:23:22,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:23:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2024-10-10 22:23:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950571909] [2024-10-10 22:23:22,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:23:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:23:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:23:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:23:22,612 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:22,872 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-10 22:23:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-10 22:23:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-10 22:23:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:22,874 INFO L225 Difference]: With dead ends: 34 [2024-10-10 22:23:22,874 INFO L226 Difference]: Without dead ends: 23 [2024-10-10 22:23:22,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2024-10-10 22:23:22,875 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:22,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:23:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-10 22:23:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-10 22:23:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-10 22:23:22,879 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2024-10-10 22:23:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:22,880 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-10 22:23:22,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-10 22:23:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:23:22,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:22,881 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:22,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:23:23,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:23,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -60842589, now seen corresponding path program 3 times [2024-10-10 22:23:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054874712] [2024-10-10 22:23:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054874712] [2024-10-10 22:23:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054874712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:23:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103323800] [2024-10-10 22:23:23,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:23:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:23,197 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 22:23:23,198 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 22:23:23,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-10 22:23:23,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:23:23,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:23:23,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:23:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:23,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:23:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103323800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:23:23,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:23:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-10 22:23:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380513297] [2024-10-10 22:23:23,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:23:23,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:23:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:23,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:23:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:23:23,394 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:23,474 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-10-10 22:23:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:23:23,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-10 22:23:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:23,475 INFO L225 Difference]: With dead ends: 45 [2024-10-10 22:23:23,476 INFO L226 Difference]: Without dead ends: 25 [2024-10-10 22:23:23,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:23:23,477 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:23,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:23:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-10 22:23:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-10 22:23:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-10 22:23:23,481 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2024-10-10 22:23:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:23,482 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-10 22:23:23,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-10-10 22:23:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:23:23,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:23,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:23,499 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 22:23:23,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:23,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -673683682, now seen corresponding path program 4 times [2024-10-10 22:23:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966776129] [2024-10-10 22:23:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966776129] [2024-10-10 22:23:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966776129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:23:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567199835] [2024-10-10 22:23:24,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:23:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:24,474 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 22:23:24,475 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 22:23:24,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:23:24,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:23:24,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-10 22:23:24,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:23:24,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2024-10-10 22:23:24,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-10 22:23:24,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2024-10-10 22:23:24,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 111 [2024-10-10 22:23:24,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 137 [2024-10-10 22:23:24,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2024-10-10 22:23:26,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-10 22:23:27,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2024-10-10 22:23:33,035 INFO L349 Elim1Store]: treesize reduction 99, result has 46.2 percent of original size [2024-10-10 22:23:33,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 215 treesize of output 199 [2024-10-10 22:23:33,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-10 22:23:33,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2024-10-10 22:23:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:23:33,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:23:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:23:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567199835] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:23:34,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:23:34,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-10-10 22:23:34,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440473964] [2024-10-10 22:23:34,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:23:34,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-10 22:23:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-10 22:23:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1334, Unknown=1, NotChecked=0, Total=1560 [2024-10-10 22:23:34,574 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:39,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:23:53,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:24:11,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:24:19,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:24:24,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:24:34,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:24:54,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]