./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.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/uthash-2.0.2/uthash_JEN_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:29:46,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:29:46,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:29:46,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:29:46,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:29:46,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:29:46,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:29:46,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:29:46,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:29:46,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:29:46,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:29:46,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:29:46,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:29:46,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:29:46,409 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:29:46,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:29:46,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:29:46,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:29:46,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:29:46,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:29:46,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:29:46,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:29:46,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:29:46,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:29:46,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:29:46,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:29:46,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:29:46,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:29:46,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:29:46,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:29:46,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:29:46,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:29:46,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:46,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:29:46,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:29:46,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:29:46,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:29:46,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:29:46,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:29:46,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:29:46,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:29:46,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:29:46,420 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-10-11 16:29:46,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:29:46,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:29:46,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:29:46,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:29:46,705 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:29:46,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-10-11 16:29:48,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:29:48,412 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:29:48,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-10-11 16:29:48,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2aaff702/4506dbf120594557a6244e19e21a4a0b/FLAG6f2202a48 [2024-10-11 16:29:48,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f2aaff702/4506dbf120594557a6244e19e21a4a0b [2024-10-11 16:29:48,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:29:48,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:29:48,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:48,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:29:48,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:29:48,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:48" (1/1) ... [2024-10-11 16:29:48,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e253abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:48, skipping insertion in model container [2024-10-11 16:29:48,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:48" (1/1) ... [2024-10-11 16:29:48,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:29:48,944 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/uthash-2.0.2/uthash_JEN_nondet_test4-3.i[33519,33532] [2024-10-11 16:29:49,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:49,085 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:29:49,124 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/uthash-2.0.2/uthash_JEN_nondet_test4-3.i[33519,33532] [2024-10-11 16:29:49,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:49,230 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:29:49,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49 WrapperNode [2024-10-11 16:29:49,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:49,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:49,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:29:49,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:29:49,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,373 INFO L138 Inliner]: procedures = 176, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1864 [2024-10-11 16:29:49,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:49,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:29:49,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:29:49,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:29:49,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,560 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-11 16:29:49,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:29:49,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:29:49,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:29:49,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:29:49,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (1/1) ... [2024-10-11 16:29:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:49,685 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-11 16:29:49,689 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-11 16:29:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:29:49,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:29:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:29:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:29:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:29:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:29:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:29:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:29:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:29:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:29:49,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:29:50,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:29:50,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:29:51,822 INFO L? ?]: Removed 420 outVars from TransFormulas that were not future-live. [2024-10-11 16:29:51,823 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:29:51,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:29:51,870 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-11 16:29:51,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:51 BoogieIcfgContainer [2024-10-11 16:29:51,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:29:51,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:29:51,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:29:51,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:29:51,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:29:48" (1/3) ... [2024-10-11 16:29:51,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3eb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:51, skipping insertion in model container [2024-10-11 16:29:51,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:49" (2/3) ... [2024-10-11 16:29:51,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3eb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:51, skipping insertion in model container [2024-10-11 16:29:51,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:51" (3/3) ... [2024-10-11 16:29:51,881 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-3.i [2024-10-11 16:29:51,896 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:29:51,897 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:29:51,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:29:51,984 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;@7d16fc6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:29:51,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:29:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 461 states, 452 states have (on average 1.6238938053097345) internal successors, (734), 453 states have internal predecessors, (734), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 16:29:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:29:51,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:51,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:51,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:52,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1046347056, now seen corresponding path program 1 times [2024-10-11 16:29:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:52,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989132115] [2024-10-11 16:29:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:52,309 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-11 16:29:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989132115] [2024-10-11 16:29:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989132115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:52,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:52,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:29:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010211891] [2024-10-11 16:29:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:52,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:52,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:52,346 INFO L87 Difference]: Start difference. First operand has 461 states, 452 states have (on average 1.6238938053097345) internal successors, (734), 453 states have internal predecessors, (734), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11 16:29:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:52,824 INFO L93 Difference]: Finished difference Result 1243 states and 2014 transitions. [2024-10-11 16:29:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:52,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 16:29:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:52,849 INFO L225 Difference]: With dead ends: 1243 [2024-10-11 16:29:52,849 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 16:29:52,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11 16:29:52,861 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 467 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:52,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1887 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 16:29:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-11 16:29:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4560906515580736) internal successors, (1028), 706 states have internal predecessors, (1028), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:29:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1046 transitions. [2024-10-11 16:29:52,954 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1046 transitions. Word has length 9 [2024-10-11 16:29:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:52,955 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1046 transitions. [2024-10-11 16:29:52,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11 16:29:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1046 transitions. [2024-10-11 16:29:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:52,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:52,965 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:52,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:29:52,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1861923141, now seen corresponding path program 1 times [2024-10-11 16:29:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939632863] [2024-10-11 16:29:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939632863] [2024-10-11 16:29:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939632863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:53,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:29:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039022971] [2024-10-11 16:29:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:29:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:29:53,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:53,722 INFO L87 Difference]: Start difference. First operand 717 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:54,660 INFO L93 Difference]: Finished difference Result 1383 states and 2021 transitions. [2024-10-11 16:29:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:29:54,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:29:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:54,667 INFO L225 Difference]: With dead ends: 1383 [2024-10-11 16:29:54,667 INFO L226 Difference]: Without dead ends: 725 [2024-10-11 16:29:54,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:54,672 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 107 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:54,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1975 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 16:29:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-11 16:29:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 717. [2024-10-11 16:29:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4362606232294617) internal successors, (1014), 706 states have internal predecessors, (1014), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:29:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1032 transitions. [2024-10-11 16:29:54,715 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1032 transitions. Word has length 168 [2024-10-11 16:29:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:54,716 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1032 transitions. [2024-10-11 16:29:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1032 transitions. [2024-10-11 16:29:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:54,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:54,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:54,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:29:54,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 30989113, now seen corresponding path program 1 times [2024-10-11 16:29:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185941541] [2024-10-11 16:29:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185941541] [2024-10-11 16:29:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185941541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105129172] [2024-10-11 16:29:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:55,088 INFO L87 Difference]: Start difference. First operand 717 states and 1032 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:55,447 INFO L93 Difference]: Finished difference Result 1373 states and 1988 transitions. [2024-10-11 16:29:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:29:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:55,453 INFO L225 Difference]: With dead ends: 1373 [2024-10-11 16:29:55,453 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 16:29:55,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-11 16:29:55,456 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 3 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:55,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1551 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 16:29:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-10-11 16:29:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 718 states have (on average 1.4289693593314763) internal successors, (1026), 718 states have internal predecessors, (1026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:29:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1044 transitions. [2024-10-11 16:29:55,478 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1044 transitions. Word has length 168 [2024-10-11 16:29:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:55,479 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1044 transitions. [2024-10-11 16:29:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1044 transitions. [2024-10-11 16:29:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:55,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:55,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:55,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:29:55,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:55,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash -379621253, now seen corresponding path program 1 times [2024-10-11 16:29:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:55,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464647760] [2024-10-11 16:29:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:55,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464647760] [2024-10-11 16:29:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464647760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:55,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:55,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597407701] [2024-10-11 16:29:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:55,744 INFO L87 Difference]: Start difference. First operand 729 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:56,114 INFO L93 Difference]: Finished difference Result 1311 states and 1888 transitions. [2024-10-11 16:29:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:29:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:56,118 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 16:29:56,119 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 16:29:56,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-11 16:29:56,122 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 136 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:56,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1578 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 16:29:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2024-10-11 16:29:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 716 states have (on average 1.4287709497206704) internal successors, (1023), 716 states have internal predecessors, (1023), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:29:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1041 transitions. [2024-10-11 16:29:56,143 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1041 transitions. Word has length 168 [2024-10-11 16:29:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1041 transitions. [2024-10-11 16:29:56,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1041 transitions. [2024-10-11 16:29:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:29:56,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:56,146 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:56,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:29:56,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:56,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash -416051727, now seen corresponding path program 1 times [2024-10-11 16:29:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:56,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756228428] [2024-10-11 16:29:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:29:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:29:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:29:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:29:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:29:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756228428] [2024-10-11 16:29:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756228428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:29:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454810952] [2024-10-11 16:29:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:29:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:29:56,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:56,552 INFO L87 Difference]: Start difference. First operand 727 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:29:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:56,927 INFO L93 Difference]: Finished difference Result 1170 states and 1680 transitions. [2024-10-11 16:29:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:29:56,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 181 [2024-10-11 16:29:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:56,932 INFO L225 Difference]: With dead ends: 1170 [2024-10-11 16:29:56,933 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 16:29:56,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:56,934 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 32 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:56,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1732 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 16:29:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2024-10-11 16:29:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 632 states have (on average 1.375) internal successors, (869), 632 states have internal predecessors, (869), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:29:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2024-10-11 16:29:56,960 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 181 [2024-10-11 16:29:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:56,960 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2024-10-11 16:29:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:29:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2024-10-11 16:29:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:29:56,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:56,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:29:56,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1392624259, now seen corresponding path program 1 times [2024-10-11 16:29:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647614708] [2024-10-11 16:29:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:29:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:29:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:29:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:29:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:29:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647614708] [2024-10-11 16:29:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647614708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432495157] [2024-10-11 16:29:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:58,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:58,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:58,163 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-11 16:29:58,164 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-11 16:29:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:58,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 16:29:58,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:58,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-10-11 16:29:59,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:29:59,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2024-10-11 16:29:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:29:59,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432495157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:29:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946774766] [2024-10-11 16:29:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:59,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:29:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:29:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:29:59,467 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:01,668 INFO L93 Difference]: Finished difference Result 1298 states and 1779 transitions. [2024-10-11 16:30:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:30:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2024-10-11 16:30:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:01,672 INFO L225 Difference]: With dead ends: 1298 [2024-10-11 16:30:01,673 INFO L226 Difference]: Without dead ends: 746 [2024-10-11 16:30:01,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:30:01,674 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 729 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:01,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3047 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 16:30:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-11 16:30:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 675. [2024-10-11 16:30:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 664 states have (on average 1.3644578313253013) internal successors, (906), 664 states have internal predecessors, (906), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 924 transitions. [2024-10-11 16:30:01,692 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 924 transitions. Word has length 181 [2024-10-11 16:30:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:01,692 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 924 transitions. [2024-10-11 16:30:01,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 924 transitions. [2024-10-11 16:30:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:30:01,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:01,694 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:01,716 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-11 16:30:01,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:01,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:01,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1047796097, now seen corresponding path program 1 times [2024-10-11 16:30:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392540896] [2024-10-11 16:30:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:30:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:30:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:30:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:02,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:30:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:02,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:02,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392540896] [2024-10-11 16:30:02,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392540896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:02,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:30:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924224276] [2024-10-11 16:30:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:02,197 INFO L87 Difference]: Start difference. First operand 675 states and 924 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:02,533 INFO L93 Difference]: Finished difference Result 1181 states and 1620 transitions. [2024-10-11 16:30:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:30:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2024-10-11 16:30:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:02,536 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 16:30:02,537 INFO L226 Difference]: Without dead ends: 537 [2024-10-11 16:30:02,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:30:02,539 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 11 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:02,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1429 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:30:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-11 16:30:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2024-10-11 16:30:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3282442748091603) internal successors, (696), 524 states have internal predecessors, (696), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 714 transitions. [2024-10-11 16:30:02,558 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 714 transitions. Word has length 181 [2024-10-11 16:30:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:02,558 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 714 transitions. [2024-10-11 16:30:02,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 714 transitions. [2024-10-11 16:30:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 16:30:02,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:02,560 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:30:02,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:02,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 301590257, now seen corresponding path program 1 times [2024-10-11 16:30:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765149857] [2024-10-11 16:30:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:30:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765149857] [2024-10-11 16:30:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765149857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868298860] [2024-10-11 16:30:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:03,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:03,561 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-11 16:30:03,562 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-11 16:30:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:04,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 16:30:04,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:04,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868298860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:04,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:04,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:30:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107325010] [2024-10-11 16:30:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:04,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:04,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:04,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:04,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:04,225 INFO L87 Difference]: Start difference. First operand 535 states and 714 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:04,346 INFO L93 Difference]: Finished difference Result 1033 states and 1389 transitions. [2024-10-11 16:30:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-10-11 16:30:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:04,349 INFO L225 Difference]: With dead ends: 1033 [2024-10-11 16:30:04,349 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 16:30:04,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:04,350 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 13 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:04,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1047 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 16:30:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-10-11 16:30:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3244274809160306) internal successors, (694), 524 states have internal predecessors, (694), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 712 transitions. [2024-10-11 16:30:04,364 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 712 transitions. Word has length 182 [2024-10-11 16:30:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:04,365 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 712 transitions. [2024-10-11 16:30:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 712 transitions. [2024-10-11 16:30:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 16:30:04,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:04,367 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:04,387 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-11 16:30:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:04,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:04,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:04,569 INFO L85 PathProgramCache]: Analyzing trace with hash 621013976, now seen corresponding path program 1 times [2024-10-11 16:30:04,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:04,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505029859] [2024-10-11 16:30:04,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:30:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:30:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 16:30:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 16:30:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:05,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505029859] [2024-10-11 16:30:05,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505029859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:05,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:30:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743113955] [2024-10-11 16:30:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:05,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:30:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:30:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:05,076 INFO L87 Difference]: Start difference. First operand 535 states and 712 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:05,624 INFO L93 Difference]: Finished difference Result 1038 states and 1402 transitions. [2024-10-11 16:30:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:30:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2024-10-11 16:30:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:05,627 INFO L225 Difference]: With dead ends: 1038 [2024-10-11 16:30:05,627 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:30:05,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:05,629 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 6 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:05,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1950 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:30:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:30:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:30:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 530 states have (on average 1.320754716981132) internal successors, (700), 530 states have internal predecessors, (700), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 718 transitions. [2024-10-11 16:30:05,645 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 718 transitions. Word has length 183 [2024-10-11 16:30:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:05,645 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 718 transitions. [2024-10-11 16:30:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 718 transitions. [2024-10-11 16:30:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:30:05,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:05,647 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:05,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:30:05,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1889367030, now seen corresponding path program 1 times [2024-10-11 16:30:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376240720] [2024-10-11 16:30:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:30:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:06,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376240720] [2024-10-11 16:30:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376240720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:30:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401918794] [2024-10-11 16:30:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:06,126 INFO L87 Difference]: Start difference. First operand 541 states and 718 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:06,837 INFO L93 Difference]: Finished difference Result 1044 states and 1406 transitions. [2024-10-11 16:30:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:06,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2024-10-11 16:30:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:06,840 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 16:30:06,840 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 16:30:06,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:06,842 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 10 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:06,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2245 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:30:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 16:30:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2024-10-11 16:30:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 538 states have (on average 1.3197026022304832) internal successors, (710), 538 states have internal predecessors, (710), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 728 transitions. [2024-10-11 16:30:06,861 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 728 transitions. Word has length 184 [2024-10-11 16:30:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:06,862 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 728 transitions. [2024-10-11 16:30:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 728 transitions. [2024-10-11 16:30:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:30:06,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:06,865 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:30:06,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1536243438, now seen corresponding path program 1 times [2024-10-11 16:30:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382844523] [2024-10-11 16:30:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:07,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:30:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:30:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382844523] [2024-10-11 16:30:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382844523] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860420745] [2024-10-11 16:30:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:07,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:07,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:07,872 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-11 16:30:07,874 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-11 16:30:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:08,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 16:30:08,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 16:30:08,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:08,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860420745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:08,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:08,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-10-11 16:30:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034843894] [2024-10-11 16:30:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:30:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:30:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:30:08,695 INFO L87 Difference]: Start difference. First operand 549 states and 728 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:08,988 INFO L93 Difference]: Finished difference Result 930 states and 1247 transitions. [2024-10-11 16:30:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:30:08,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2024-10-11 16:30:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:08,994 INFO L225 Difference]: With dead ends: 930 [2024-10-11 16:30:08,994 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 16:30:08,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:30:08,996 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 30 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:08,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1737 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:30:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 16:30:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2024-10-11 16:30:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 552 states have (on average 1.315217391304348) internal successors, (726), 552 states have internal predecessors, (726), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 744 transitions. [2024-10-11 16:30:09,034 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 744 transitions. Word has length 184 [2024-10-11 16:30:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 744 transitions. [2024-10-11 16:30:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 744 transitions. [2024-10-11 16:30:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 16:30:09,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:09,038 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:09,068 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-11 16:30:09,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:09,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:09,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1780111202, now seen corresponding path program 1 times [2024-10-11 16:30:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647919287] [2024-10-11 16:30:09,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:09,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 16:30:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 16:30:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:09,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:09,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647919287] [2024-10-11 16:30:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647919287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:09,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:09,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:30:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585658282] [2024-10-11 16:30:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:09,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:09,992 INFO L87 Difference]: Start difference. First operand 563 states and 744 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:10,646 INFO L93 Difference]: Finished difference Result 938 states and 1253 transitions. [2024-10-11 16:30:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 185 [2024-10-11 16:30:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:10,649 INFO L225 Difference]: With dead ends: 938 [2024-10-11 16:30:10,649 INFO L226 Difference]: Without dead ends: 573 [2024-10-11 16:30:10,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:30:10,650 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 22 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:10,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2238 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:30:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-11 16:30:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 557. [2024-10-11 16:30:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 546 states have (on average 1.3113553113553114) internal successors, (716), 546 states have internal predecessors, (716), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 734 transitions. [2024-10-11 16:30:10,668 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 734 transitions. Word has length 185 [2024-10-11 16:30:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 734 transitions. [2024-10-11 16:30:10,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 734 transitions. [2024-10-11 16:30:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 16:30:10,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:10,671 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:10,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:30:10,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:10,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2073218103, now seen corresponding path program 1 times [2024-10-11 16:30:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520193914] [2024-10-11 16:30:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:30:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 16:30:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520193914] [2024-10-11 16:30:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520193914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:30:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444163773] [2024-10-11 16:30:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:11,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:11,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:11,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:11,351 INFO L87 Difference]: Start difference. First operand 557 states and 734 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:11,960 INFO L93 Difference]: Finished difference Result 937 states and 1250 transitions. [2024-10-11 16:30:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2024-10-11 16:30:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:11,967 INFO L225 Difference]: With dead ends: 937 [2024-10-11 16:30:11,967 INFO L226 Difference]: Without dead ends: 577 [2024-10-11 16:30:11,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:11,969 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 17 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:11,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2260 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:30:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-11 16:30:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 563. [2024-10-11 16:30:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 552 states have (on average 1.3079710144927537) internal successors, (722), 552 states have internal predecessors, (722), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:30:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 740 transitions. [2024-10-11 16:30:11,985 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 740 transitions. Word has length 186 [2024-10-11 16:30:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:11,985 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 740 transitions. [2024-10-11 16:30:11,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 740 transitions. [2024-10-11 16:30:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 16:30:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:11,988 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:30:11,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1876577931, now seen corresponding path program 1 times [2024-10-11 16:30:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203896538] [2024-10-11 16:30:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:30:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 16:30:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:30:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203896538] [2024-10-11 16:30:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203896538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851118178] [2024-10-11 16:30:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:12,760 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-11 16:30:12,762 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-11 16:30:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:13,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 16:30:13,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 16:30:13,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851118178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:13,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:13,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 16:30:13,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951793394] [2024-10-11 16:30:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:13,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:13,529 INFO L87 Difference]: Start difference. First operand 563 states and 740 transitions. Second operand has 5 states, 4 states have (on average 44.25) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:13,609 INFO L93 Difference]: Finished difference Result 1096 states and 1455 transitions. [2024-10-11 16:30:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:30:13,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 44.25) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 187 [2024-10-11 16:30:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:13,613 INFO L225 Difference]: With dead ends: 1096 [2024-10-11 16:30:13,613 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 16:30:13,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:13,614 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 366 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:13,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1559 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 16:30:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 565. [2024-10-11 16:30:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 553 states have (on average 1.3092224231464737) internal successors, (724), 554 states have internal predecessors, (724), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 745 transitions. [2024-10-11 16:30:13,632 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 745 transitions. Word has length 187 [2024-10-11 16:30:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:13,632 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 745 transitions. [2024-10-11 16:30:13,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 44.25) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2024-10-11 16:30:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 16:30:13,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:13,634 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:13,657 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-11 16:30:13,835 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,SelfDestructingSolverStorable13 [2024-10-11 16:30:13,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash -187335733, now seen corresponding path program 1 times [2024-10-11 16:30:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951553940] [2024-10-11 16:30:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:30:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 16:30:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 16:30:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951553940] [2024-10-11 16:30:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951553940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342199354] [2024-10-11 16:30:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:14,986 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-11 16:30:14,987 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-11 16:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:15,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:30:15,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:15,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342199354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 16:30:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069492495] [2024-10-11 16:30:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:30:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:30:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:16,002 INFO L87 Difference]: Start difference. First operand 565 states and 745 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:16,376 INFO L93 Difference]: Finished difference Result 1086 states and 1444 transitions. [2024-10-11 16:30:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:30:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-10-11 16:30:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:16,380 INFO L225 Difference]: With dead ends: 1086 [2024-10-11 16:30:16,380 INFO L226 Difference]: Without dead ends: 575 [2024-10-11 16:30:16,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:16,382 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 8 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:16,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1964 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:30:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-11 16:30:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 565. [2024-10-11 16:30:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 553 states have (on average 1.3092224231464737) internal successors, (724), 554 states have internal predecessors, (724), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 745 transitions. [2024-10-11 16:30:16,404 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 745 transitions. Word has length 191 [2024-10-11 16:30:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:16,405 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 745 transitions. [2024-10-11 16:30:16,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2024-10-11 16:30:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 16:30:16,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:16,408 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:16,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:16,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 16:30:16,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2131042765, now seen corresponding path program 1 times [2024-10-11 16:30:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759885715] [2024-10-11 16:30:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:30:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:30:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 16:30:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759885715] [2024-10-11 16:30:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759885715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:30:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703229899] [2024-10-11 16:30:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:30:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:30:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:30:17,225 INFO L87 Difference]: Start difference. First operand 565 states and 745 transitions. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:17,866 INFO L93 Difference]: Finished difference Result 1091 states and 1448 transitions. [2024-10-11 16:30:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:30:17,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2024-10-11 16:30:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:17,869 INFO L225 Difference]: With dead ends: 1091 [2024-10-11 16:30:17,869 INFO L226 Difference]: Without dead ends: 585 [2024-10-11 16:30:17,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:30:17,870 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 18 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:17,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2943 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:30:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-11 16:30:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-10-11 16:30:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 567 states have (on average 1.308641975308642) internal successors, (742), 568 states have internal predecessors, (742), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 763 transitions. [2024-10-11 16:30:17,888 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 763 transitions. Word has length 192 [2024-10-11 16:30:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 763 transitions. [2024-10-11 16:30:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 763 transitions. [2024-10-11 16:30:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 16:30:17,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:17,891 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:17,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:30:17,892 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:17,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1143166799, now seen corresponding path program 1 times [2024-10-11 16:30:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:17,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354735165] [2024-10-11 16:30:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:30:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:30:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 16:30:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 16:30:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354735165] [2024-10-11 16:30:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354735165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079295390] [2024-10-11 16:30:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:26,933 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-11 16:30:26,934 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-11 16:30:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 16:30:27,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:27,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079295390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:27,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2024-10-11 16:30:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283539591] [2024-10-11 16:30:27,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:27,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:27,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2024-10-11 16:30:27,875 INFO L87 Difference]: Start difference. First operand 579 states and 763 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:28,382 INFO L93 Difference]: Finished difference Result 1112 states and 1475 transitions. [2024-10-11 16:30:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2024-10-11 16:30:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:28,386 INFO L225 Difference]: With dead ends: 1112 [2024-10-11 16:30:28,386 INFO L226 Difference]: Without dead ends: 599 [2024-10-11 16:30:28,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2024-10-11 16:30:28,388 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 13 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:28,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2009 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:30:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-11 16:30:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 589. [2024-10-11 16:30:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 577 states have (on average 1.3067590987868285) internal successors, (754), 578 states have internal predecessors, (754), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 775 transitions. [2024-10-11 16:30:28,403 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 775 transitions. Word has length 192 [2024-10-11 16:30:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:28,404 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 775 transitions. [2024-10-11 16:30:28,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 775 transitions. [2024-10-11 16:30:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 16:30:28,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:28,406 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:28,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:28,607 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,SelfDestructingSolverStorable16 [2024-10-11 16:30:28,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -440053157, now seen corresponding path program 1 times [2024-10-11 16:30:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62298409] [2024-10-11 16:30:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:30:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:30:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 16:30:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 16:30:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62298409] [2024-10-11 16:30:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62298409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:30:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480504760] [2024-10-11 16:30:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:29,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:30:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:30:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:29,359 INFO L87 Difference]: Start difference. First operand 589 states and 775 transitions. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:30,103 INFO L93 Difference]: Finished difference Result 1130 states and 1499 transitions. [2024-10-11 16:30:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:30:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2024-10-11 16:30:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:30,107 INFO L225 Difference]: With dead ends: 1130 [2024-10-11 16:30:30,107 INFO L226 Difference]: Without dead ends: 607 [2024-10-11 16:30:30,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:30:30,108 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 21 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:30,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3261 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:30:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-11 16:30:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 595. [2024-10-11 16:30:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 583 states have (on average 1.3036020583190395) internal successors, (760), 584 states have internal predecessors, (760), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 781 transitions. [2024-10-11 16:30:30,122 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 781 transitions. Word has length 193 [2024-10-11 16:30:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:30,123 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 781 transitions. [2024-10-11 16:30:30,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 781 transitions. [2024-10-11 16:30:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 16:30:30,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:30,124 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:30,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:30:30,125 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:30,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1138665463, now seen corresponding path program 1 times [2024-10-11 16:30:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:30,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622436998] [2024-10-11 16:30:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:30:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:30:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 16:30:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 16:30:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:31,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:31,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622436998] [2024-10-11 16:30:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622436998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:31,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679818102] [2024-10-11 16:30:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:31,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:31,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:31,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:31,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 16:30:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 16:30:32,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:32,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679818102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-10-11 16:30:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118748399] [2024-10-11 16:30:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:30:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:30:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:30:32,602 INFO L87 Difference]: Start difference. First operand 595 states and 781 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:33,249 INFO L93 Difference]: Finished difference Result 1141 states and 1513 transitions. [2024-10-11 16:30:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:30:33,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2024-10-11 16:30:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:33,254 INFO L225 Difference]: With dead ends: 1141 [2024-10-11 16:30:33,254 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 16:30:33,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:30:33,255 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 13 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:33,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2977 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:30:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 16:30:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2024-10-11 16:30:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 597 states have (on average 1.3031825795644891) internal successors, (778), 598 states have internal predecessors, (778), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 799 transitions. [2024-10-11 16:30:33,270 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 799 transitions. Word has length 193 [2024-10-11 16:30:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 799 transitions. [2024-10-11 16:30:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 799 transitions. [2024-10-11 16:30:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 16:30:33,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:33,272 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:33,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 16:30:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:33,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:33,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -645140617, now seen corresponding path program 1 times [2024-10-11 16:30:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:33,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3886941] [2024-10-11 16:30:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:30:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:30:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:34,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 16:30:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 16:30:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:34,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:34,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3886941] [2024-10-11 16:30:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3886941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:34,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498964501] [2024-10-11 16:30:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:34,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:34,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 16:30:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 16:30:35,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:35,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498964501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:35,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:35,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 16:30:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444329114] [2024-10-11 16:30:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:35,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:30:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:30:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:35,246 INFO L87 Difference]: Start difference. First operand 609 states and 799 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:35,462 INFO L93 Difference]: Finished difference Result 1147 states and 1517 transitions. [2024-10-11 16:30:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2024-10-11 16:30:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:35,466 INFO L225 Difference]: With dead ends: 1147 [2024-10-11 16:30:35,466 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 16:30:35,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:30:35,468 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 31 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:35,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1975 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:30:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 16:30:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 613. [2024-10-11 16:30:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 601 states have (on average 1.3011647254575707) internal successors, (782), 602 states have internal predecessors, (782), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:30:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 803 transitions. [2024-10-11 16:30:35,481 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 803 transitions. Word has length 193 [2024-10-11 16:30:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 803 transitions. [2024-10-11 16:30:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 803 transitions. [2024-10-11 16:30:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 16:30:35,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:35,483 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:35,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 16:30:35,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:35,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1800750064, now seen corresponding path program 1 times [2024-10-11 16:30:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:35,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256082065] [2024-10-11 16:30:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:30:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:30:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 16:30:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 16:30:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:36,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256082065] [2024-10-11 16:30:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256082065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:36,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914835757] [2024-10-11 16:30:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:36,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:36,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:36,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:36,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 16:30:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 259 conjuncts are in the unsatisfiable core [2024-10-11 16:30:37,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:37,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 16:30:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 16:30:37,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-11 16:30:37,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-10-11 16:30:37,948 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 16:30:37,949 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 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 16:30:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-11 16:30:37,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11 16:30:37,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11 16:30:38,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 16:30:38,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 16:30:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 16:30:38,217 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 16:30:38,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-10-11 16:30:38,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 16:30:38,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2024-10-11 16:30:46,903 INFO L224 Elim1Store]: Index analysis took 223 ms