./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_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:03:20,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:03:20,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 13:03:20,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:03:20,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:03:20,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:03:20,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:03:20,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:03:20,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 13:03:20,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 13:03:20,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:03:20,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:03:20,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:03:20,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:03:20,672 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:03:20,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:03:20,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:03:20,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:03:20,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:03:20,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:03:20,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:03:20,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:03:20,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:03:20,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:03:20,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:03:20,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:03:20,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:03:20,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:03:20,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:03:20,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:03:20,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 13:03:20,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:03:20,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:03:20,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:03:20,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:03:20,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:03:20,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:03:20,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-20 13:03:20,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:03:20,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:03:20,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:03:20,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:03:20,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:03:20,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-20 13:03:22,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:03:22,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:03:22,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-20 13:03:22,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b51c3502/39f00e459b6b4d8493cef3d3cb179dd8/FLAG321da32e4 [2024-11-20 13:03:22,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b51c3502/39f00e459b6b4d8493cef3d3cb179dd8 [2024-11-20 13:03:22,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:03:22,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:03:22,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:03:22,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:03:22,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:03:22,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:03:22" (1/1) ... [2024-11-20 13:03:22,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dea92bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:22, skipping insertion in model container [2024-11-20 13:03:22,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:03:22" (1/1) ... [2024-11-20 13:03:22,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:03:23,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-11-20 13:03:23,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-11-20 13:03:23,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-11-20 13:03:23,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:03:23,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:03:23,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-11-20 13:03:23,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-11-20 13:03:23,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-11-20 13:03:23,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:03:23,371 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:03:23,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23 WrapperNode [2024-11-20 13:03:23,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:03:23,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:03:23,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:03:23,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:03:23,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,490 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-11-20 13:03:23,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:03:23,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:03:23,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:03:23,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:03:23,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,569 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [217, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-20 13:03:23,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:03:23,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:03:23,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:03:23,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:03:23,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (1/1) ... [2024-11-20 13:03:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:03:23,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:03:23,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 13:03:23,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 13:03:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 13:03:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 13:03:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 13:03:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 13:03:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 13:03:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 13:03:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 13:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 13:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 13:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 13:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 13:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 13:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 13:03:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:03:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:03:23,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:03:23,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:03:25,094 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-20 13:03:25,094 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:03:25,117 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:03:25,117 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-20 13:03:25,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:03:25 BoogieIcfgContainer [2024-11-20 13:03:25,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:03:25,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:03:25,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:03:25,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:03:25,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:03:22" (1/3) ... [2024-11-20 13:03:25,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5744b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:03:25, skipping insertion in model container [2024-11-20 13:03:25,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:03:23" (2/3) ... [2024-11-20 13:03:25,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5744b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:03:25, skipping insertion in model container [2024-11-20 13:03:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:03:25" (3/3) ... [2024-11-20 13:03:25,126 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-11-20 13:03:25,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:03:25,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 13:03:25,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:03:25,205 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;@5ab61a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:03:25,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 13:03:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 13:03:25,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:25,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:03:25,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:25,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -59717688, now seen corresponding path program 1 times [2024-11-20 13:03:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175224810] [2024-11-20 13:03:25,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:03:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175224810] [2024-11-20 13:03:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175224810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:03:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886311841] [2024-11-20 13:03:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 13:03:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 13:03:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 13:03:25,378 INFO L87 Difference]: Start difference. First operand has 396 states, 389 states have (on average 1.6246786632390746) internal successors, (632), 391 states have internal predecessors, (632), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:25,422 INFO L93 Difference]: Finished difference Result 789 states and 1273 transitions. [2024-11-20 13:03:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 13:03:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-20 13:03:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:25,433 INFO L225 Difference]: With dead ends: 789 [2024-11-20 13:03:25,434 INFO L226 Difference]: Without dead ends: 391 [2024-11-20 13:03:25,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 13:03:25,440 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:25,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 13:03:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-20 13:03:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-20 13:03:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-11-20 13:03:25,492 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 8 [2024-11-20 13:03:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:25,492 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-11-20 13:03:25,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-11-20 13:03:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 13:03:25,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:25,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:03:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:03:25,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -690874686, now seen corresponding path program 1 times [2024-11-20 13:03:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723792147] [2024-11-20 13:03:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:03:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723792147] [2024-11-20 13:03:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723792147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:25,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:03:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121113437] [2024-11-20 13:03:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:03:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:03:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:03:25,662 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:25,791 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2024-11-20 13:03:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 13:03:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 13:03:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:25,795 INFO L225 Difference]: With dead ends: 965 [2024-11-20 13:03:25,795 INFO L226 Difference]: Without dead ends: 775 [2024-11-20 13:03:25,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:03:25,797 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 548 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:25,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1715 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 13:03:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-20 13:03:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 393. [2024-11-20 13:03:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2024-11-20 13:03:25,824 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 10 [2024-11-20 13:03:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:25,825 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2024-11-20 13:03:25,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2024-11-20 13:03:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-20 13:03:25,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:25,828 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 13:03:25,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:03:25,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:25,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1711501341, now seen corresponding path program 1 times [2024-11-20 13:03:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558942994] [2024-11-20 13:03:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:03:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558942994] [2024-11-20 13:03:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558942994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:03:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081641410] [2024-11-20 13:03:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:03:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:03:26,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:03:26,142 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:26,215 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2024-11-20 13:03:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:03:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2024-11-20 13:03:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:26,219 INFO L225 Difference]: With dead ends: 740 [2024-11-20 13:03:26,219 INFO L226 Difference]: Without dead ends: 351 [2024-11-20 13:03:26,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:03:26,221 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:26,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 13:03:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-20 13:03:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-20 13:03:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.4) internal successors, (483), 346 states have internal predecessors, (483), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-20 13:03:26,244 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 86 [2024-11-20 13:03:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-20 13:03:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-20 13:03:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-20 13:03:26,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:26,247 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 13:03:26,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:03:26,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:26,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782545, now seen corresponding path program 1 times [2024-11-20 13:03:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:26,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558228225] [2024-11-20 13:03:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:03:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558228225] [2024-11-20 13:03:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558228225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:03:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105443322] [2024-11-20 13:03:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:03:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:03:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:03:26,413 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:26,496 INFO L93 Difference]: Finished difference Result 949 states and 1335 transitions. [2024-11-20 13:03:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:03:26,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2024-11-20 13:03:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:26,498 INFO L225 Difference]: With dead ends: 949 [2024-11-20 13:03:26,498 INFO L226 Difference]: Without dead ends: 602 [2024-11-20 13:03:26,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:03:26,500 INFO L432 NwaCegarLoop]: 667 mSDtfsCounter, 295 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:26,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 13:03:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-20 13:03:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-20 13:03:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-11-20 13:03:26,512 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 86 [2024-11-20 13:03:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-11-20 13:03:26,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:03:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-11-20 13:03:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 13:03:26,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:26,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-20 13:03:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:03:26,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1351912583, now seen corresponding path program 1 times [2024-11-20 13:03:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11591656] [2024-11-20 13:03:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 13:03:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11591656] [2024-11-20 13:03:26,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11591656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:26,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:26,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:03:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79172782] [2024-11-20 13:03:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:26,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:03:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:03:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:03:26,840 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-11-20 13:03:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:27,115 INFO L93 Difference]: Finished difference Result 883 states and 1252 transitions. [2024-11-20 13:03:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:03:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 101 [2024-11-20 13:03:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:27,120 INFO L225 Difference]: With dead ends: 883 [2024-11-20 13:03:27,120 INFO L226 Difference]: Without dead ends: 879 [2024-11-20 13:03:27,120 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-11-20 13:03:27,122 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 461 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:27,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1879 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 13:03:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-20 13:03:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 600. [2024-11-20 13:03:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 595 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 847 transitions. [2024-11-20 13:03:27,139 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 847 transitions. Word has length 101 [2024-11-20 13:03:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:27,140 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 847 transitions. [2024-11-20 13:03:27,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-11-20 13:03:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 847 transitions. [2024-11-20 13:03:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 13:03:27,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:27,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-20 13:03:27,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:03:27,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 754208712, now seen corresponding path program 1 times [2024-11-20 13:03:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513266417] [2024-11-20 13:03:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 13:03:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513266417] [2024-11-20 13:03:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513266417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:27,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:27,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:03:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099085852] [2024-11-20 13:03:27,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:03:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:03:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:03:27,406 INFO L87 Difference]: Start difference. First operand 600 states and 847 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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-11-20 13:03:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:27,624 INFO L93 Difference]: Finished difference Result 868 states and 1233 transitions. [2024-11-20 13:03:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:03:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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 155 [2024-11-20 13:03:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:27,627 INFO L225 Difference]: With dead ends: 868 [2024-11-20 13:03:27,627 INFO L226 Difference]: Without dead ends: 519 [2024-11-20 13:03:27,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-20 13:03:27,629 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 33 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:27,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 13:03:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-20 13:03:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 516. [2024-11-20 13:03:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.3470588235294119) internal successors, (687), 511 states have internal predecessors, (687), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2024-11-20 13:03:27,641 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 155 [2024-11-20 13:03:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2024-11-20 13:03:27,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 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-11-20 13:03:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-20 13:03:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 13:03:27,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:27,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-20 13:03:27,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:03:27,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -417305412, now seen corresponding path program 1 times [2024-11-20 13:03:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:27,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549764802] [2024-11-20 13:03:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549764802] [2024-11-20 13:03:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549764802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:03:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 13:03:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203047806] [2024-11-20 13:03:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:27,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:03:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:03:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:03:27,855 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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-11-20 13:03:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:28,279 INFO L93 Difference]: Finished difference Result 1291 states and 1738 transitions. [2024-11-20 13:03:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:03:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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 155 [2024-11-20 13:03:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:28,283 INFO L225 Difference]: With dead ends: 1291 [2024-11-20 13:03:28,284 INFO L226 Difference]: Without dead ends: 866 [2024-11-20 13:03:28,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 13:03:28,285 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 913 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:28,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1860 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 13:03:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-20 13:03:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 655. [2024-11-20 13:03:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 649 states have (on average 1.349768875192604) internal successors, (876), 650 states have internal predecessors, (876), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 13:03:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2024-11-20 13:03:28,301 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 155 [2024-11-20 13:03:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2024-11-20 13:03:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 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-11-20 13:03:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2024-11-20 13:03:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 13:03:28,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:28,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-20 13:03:28,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:03:28,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:28,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1364418704, now seen corresponding path program 1 times [2024-11-20 13:03:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261575253] [2024-11-20 13:03:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261575253] [2024-11-20 13:03:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261575253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 13:03:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305472209] [2024-11-20 13:03:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:03:29,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 13:03:29,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 13:03:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:29,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 13:03:29,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 13:03:29,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 13:03:29,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-20 13:03:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 13:03:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:29,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 13:03:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305472209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 13:03:29,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 13:03:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-20 13:03:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635337490] [2024-11-20 13:03:29,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 13:03:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 13:03:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 13:03:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-20 13:03:29,804 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:03:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:30,241 INFO L93 Difference]: Finished difference Result 2935 states and 3968 transitions. [2024-11-20 13:03:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 13:03:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2024-11-20 13:03:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:30,250 INFO L225 Difference]: With dead ends: 2935 [2024-11-20 13:03:30,250 INFO L226 Difference]: Without dead ends: 2528 [2024-11-20 13:03:30,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-20 13:03:30,251 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1906 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:30,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 3865 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 13:03:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-20 13:03:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 1002. [2024-11-20 13:03:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 992 states have (on average 1.34375) internal successors, (1333), 993 states have internal predecessors, (1333), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 13:03:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1345 transitions. [2024-11-20 13:03:30,290 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1345 transitions. Word has length 165 [2024-11-20 13:03:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:30,290 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1345 transitions. [2024-11-20 13:03:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:03:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1345 transitions. [2024-11-20 13:03:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-20 13:03:30,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:30,296 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 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] [2024-11-20 13:03:30,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 13:03:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:30,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1689091209, now seen corresponding path program 1 times [2024-11-20 13:03:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666010643] [2024-11-20 13:03:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666010643] [2024-11-20 13:03:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666010643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 13:03:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949351465] [2024-11-20 13:03:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:03:33,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 13:03:33,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 13:03:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:33,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 13:03:33,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 13:03:33,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 13:03:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-20 13:03:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:34,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:34,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:34,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 13:03:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:34,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 13:03:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949351465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 13:03:34,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 13:03:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-20 13:03:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509461057] [2024-11-20 13:03:34,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 13:03:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 13:03:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 13:03:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-20 13:03:34,880 INFO L87 Difference]: Start difference. First operand 1002 states and 1345 transitions. Second operand has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:03:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:35,627 INFO L93 Difference]: Finished difference Result 6223 states and 8423 transitions. [2024-11-20 13:03:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 13:03:35,628 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 393 [2024-11-20 13:03:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:35,642 INFO L225 Difference]: With dead ends: 6223 [2024-11-20 13:03:35,642 INFO L226 Difference]: Without dead ends: 5816 [2024-11-20 13:03:35,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 782 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-11-20 13:03:35,643 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 5356 mSDsluCounter, 5561 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5376 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:35,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5376 Valid, 5987 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 13:03:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2024-11-20 13:03:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 1866. [2024-11-20 13:03:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1850 states have (on average 1.34) internal successors, (2479), 1851 states have internal predecessors, (2479), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 13:03:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2503 transitions. [2024-11-20 13:03:35,694 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2503 transitions. Word has length 393 [2024-11-20 13:03:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:35,695 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2503 transitions. [2024-11-20 13:03:35,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:03:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2503 transitions. [2024-11-20 13:03:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-20 13:03:35,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:35,706 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 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] [2024-11-20 13:03:35,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 13:03:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-20 13:03:35,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:35,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1947931387, now seen corresponding path program 2 times [2024-11-20 13:03:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46634640] [2024-11-20 13:03:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:45,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:45,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46634640] [2024-11-20 13:03:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46634640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 13:03:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928329359] [2024-11-20 13:03:45,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 13:03:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:03:45,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 13:03:45,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 13:03:45,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 13:03:45,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 13:03:45,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 13:03:45,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 13:03:45,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 13:03:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-20 13:03:46,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 13:03:46,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928329359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:03:46,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 13:03:46,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-11-20 13:03:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472181659] [2024-11-20 13:03:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:03:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 13:03:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 13:03:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-20 13:03:46,349 INFO L87 Difference]: Start difference. First operand 1866 states and 2503 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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-11-20 13:03:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:03:47,092 INFO L93 Difference]: Finished difference Result 2450 states and 3286 transitions. [2024-11-20 13:03:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 13:03:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 849 [2024-11-20 13:03:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:03:47,098 INFO L225 Difference]: With dead ends: 2450 [2024-11-20 13:03:47,098 INFO L226 Difference]: Without dead ends: 2046 [2024-11-20 13:03:47,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 13:03:47,099 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 393 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 13:03:47,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 2947 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 13:03:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2024-11-20 13:03:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1901. [2024-11-20 13:03:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1885 states have (on average 1.3358090185676392) internal successors, (2518), 1886 states have internal predecessors, (2518), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 13:03:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2542 transitions. [2024-11-20 13:03:47,138 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2542 transitions. Word has length 849 [2024-11-20 13:03:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:03:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2542 transitions. [2024-11-20 13:03:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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-11-20 13:03:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2542 transitions. [2024-11-20 13:03:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-20 13:03:47,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:03:47,153 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 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] [2024-11-20 13:03:47,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 13:03:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:47,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:03:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:03:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1363389620, now seen corresponding path program 1 times [2024-11-20 13:03:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:03:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141337093] [2024-11-20 13:03:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:03:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:03:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:03:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:03:55,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141337093] [2024-11-20 13:03:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141337093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 13:03:55,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039134549] [2024-11-20 13:03:55,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:03:55,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:03:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:03:55,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 13:03:55,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 13:03:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:03:56,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 13:03:56,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 13:03:56,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 13:03:56,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-20 13:03:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:56,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 13:03:57,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 13:03:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:57,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 13:03:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:03:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039134549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 13:03:58,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 13:03:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 33 [2024-11-20 13:03:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659030482] [2024-11-20 13:03:58,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 13:03:58,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-20 13:03:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:03:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-20 13:03:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=644, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 13:03:58,800 INFO L87 Difference]: Start difference. First operand 1901 states and 2542 transitions. Second operand has 33 states, 33 states have (on average 51.57575757575758) internal successors, (1702), 32 states have internal predecessors, (1702), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:04:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 13:04:01,774 INFO L93 Difference]: Finished difference Result 12834 states and 17371 transitions. [2024-11-20 13:04:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-20 13:04:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 51.57575757575758) internal successors, (1702), 32 states have internal predecessors, (1702), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 850 [2024-11-20 13:04:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 13:04:01,859 INFO L225 Difference]: With dead ends: 12834 [2024-11-20 13:04:01,859 INFO L226 Difference]: Without dead ends: 12392 [2024-11-20 13:04:01,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1743 GetRequests, 1690 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=877, Invalid=1775, Unknown=0, NotChecked=0, Total=2652 [2024-11-20 13:04:01,872 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 17112 mSDsluCounter, 10911 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17156 SdHoareTripleChecker+Valid, 11337 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 13:04:01,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17156 Valid, 11337 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 13:04:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2024-11-20 13:04:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 3629. [2024-11-20 13:04:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3601 states have (on average 1.3357400722021662) internal successors, (4810), 3602 states have internal predecessors, (4810), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 13:04:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4858 transitions. [2024-11-20 13:04:02,015 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4858 transitions. Word has length 850 [2024-11-20 13:04:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 13:04:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 3629 states and 4858 transitions. [2024-11-20 13:04:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 51.57575757575758) internal successors, (1702), 32 states have internal predecessors, (1702), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 13:04:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4858 transitions. [2024-11-20 13:04:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2024-11-20 13:04:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 13:04:02,033 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 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] [2024-11-20 13:04:02,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 13:04:02,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:04:02,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 13:04:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:04:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1604787632, now seen corresponding path program 2 times [2024-11-20 13:04:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:04:02,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569251400] [2024-11-20 13:04:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:04:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:04:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:04:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 13:04:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:04:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 13:04:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:04:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17562 backedges. 0 proven. 17558 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 13:04:37,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:04:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569251400] [2024-11-20 13:04:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569251400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 13:04:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624374822] [2024-11-20 13:04:37,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 13:04:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 13:04:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:04:37,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 13:04:37,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 13:04:38,303 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 13:04:38,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 13:04:38,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 13:04:38,323 INFO L278 TraceCheckSpWp]: Computing forward predicates...