./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:17:22,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:17:22,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:17:22,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:17:22,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:17:22,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:17:22,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:17:22,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:17:22,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:17:22,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:17:22,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:17:22,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:17:22,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:17:22,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:17:22,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:17:22,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:17:22,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:17:22,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:17:22,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:17:22,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:17:22,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:17:22,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:17:22,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:17:22,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:17:22,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:17:22,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:17:22,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:17:22,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:17:22,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:17:22,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:17:22,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:17:22,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:17:22,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:17:22,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:17:22,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:17:22,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:17:22,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:17:22,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:17:22,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:17:22,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:17:22,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:17:22,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:17:22,871 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 -> 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 [2024-11-19 05:17:23,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:17:23,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:17:23,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:17:23,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:17:23,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:17:23,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2024-11-19 05:17:24,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:17:25,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:17:25,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2024-11-19 05:17:25,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7859af05e/3cac4c7aa52c42a39b67ed3d7a199282/FLAG8ec4511d5 [2024-11-19 05:17:25,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7859af05e/3cac4c7aa52c42a39b67ed3d7a199282 [2024-11-19 05:17:25,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:17:25,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:17:25,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:17:25,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:17:25,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:17:25,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:17:25" (1/1) ... [2024-11-19 05:17:25,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7439da1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:25, skipping insertion in model container [2024-11-19 05:17:25,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:17:25" (1/1) ... [2024-11-19 05:17:25,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:17:25,773 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_OAT_test7-1.i[33021,33034] [2024-11-19 05:17:25,876 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_OAT_test7-1.i[44124,44137] [2024-11-19 05:17:25,877 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_OAT_test7-1.i[44245,44258] [2024-11-19 05:17:25,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:17:25,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:17:25,943 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_OAT_test7-1.i[33021,33034] [2024-11-19 05:17:26,025 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_OAT_test7-1.i[44124,44137] [2024-11-19 05:17:26,026 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_OAT_test7-1.i[44245,44258] [2024-11-19 05:17:26,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:17:26,068 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:17:26,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26 WrapperNode [2024-11-19 05:17:26,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:17:26,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:17:26,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:17:26,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:17:26,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,165 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-11-19 05:17:26,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:17:26,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:17:26,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:17:26,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:17:26,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,297 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-19 05:17:26,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:17:26,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:17:26,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:17:26,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:17:26,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (1/1) ... [2024-11-19 05:17:26,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:17:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:17:26,421 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-19 05:17:26,423 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-19 05:17:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:17:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:17:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:17:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:17:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:17:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:17:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:17:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:17:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:17:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:17:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:17:26,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:17:26,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:17:26,799 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:17:26,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:17:28,326 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-19 05:17:28,326 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:17:28,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:17:28,355 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:17:28,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:17:28 BoogieIcfgContainer [2024-11-19 05:17:28,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:17:28,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:17:28,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:17:28,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:17:28,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:17:25" (1/3) ... [2024-11-19 05:17:28,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e972f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:17:28, skipping insertion in model container [2024-11-19 05:17:28,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:17:26" (2/3) ... [2024-11-19 05:17:28,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e972f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:17:28, skipping insertion in model container [2024-11-19 05:17:28,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:17:28" (3/3) ... [2024-11-19 05:17:28,367 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-1.i [2024-11-19 05:17:28,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:17:28,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:17:28,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:17:28,465 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;@3ebf8881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:17:28,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:17:28,473 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-19 05:17:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 05:17:28,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:28,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:17:28,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash -59717688, now seen corresponding path program 1 times [2024-11-19 05:17:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:28,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622985054] [2024-11-19 05:17:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:28,676 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-19 05:17:28,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622985054] [2024-11-19 05:17:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622985054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:17:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374192379] [2024-11-19 05:17:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:28,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:17:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:17:28,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:17:28,718 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-19 05:17:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:28,796 INFO L93 Difference]: Finished difference Result 789 states and 1273 transitions. [2024-11-19 05:17:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:17:28,798 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-19 05:17:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:28,812 INFO L225 Difference]: With dead ends: 789 [2024-11-19 05:17:28,812 INFO L226 Difference]: Without dead ends: 391 [2024-11-19 05:17:28,818 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-19 05:17:28,821 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-19 05:17:28,822 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-19 05:17:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-19 05:17:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-19 05:17:28,883 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-19 05:17:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-11-19 05:17:28,887 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 8 [2024-11-19 05:17:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:28,890 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-11-19 05:17:28,890 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-19 05:17:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-11-19 05:17:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 05:17:28,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:28,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:17:28,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:17:28,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash -690874686, now seen corresponding path program 1 times [2024-11-19 05:17:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339510114] [2024-11-19 05:17:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:29,075 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-19 05:17:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339510114] [2024-11-19 05:17:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339510114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:17:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929147944] [2024-11-19 05:17:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:17:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:29,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:17:29,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:17:29,081 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-19 05:17:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:29,254 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2024-11-19 05:17:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:17:29,254 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-19 05:17:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:29,260 INFO L225 Difference]: With dead ends: 965 [2024-11-19 05:17:29,260 INFO L226 Difference]: Without dead ends: 775 [2024-11-19 05:17:29,261 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-19 05:17:29,262 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-19 05:17:29,263 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-19 05:17:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-19 05:17:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 393. [2024-11-19 05:17:29,298 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-19 05:17:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2024-11-19 05:17:29,302 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 10 [2024-11-19 05:17:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:29,302 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2024-11-19 05:17:29,302 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-19 05:17:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2024-11-19 05:17:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:17:29,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:29,306 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-19 05:17:29,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:17:29,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1711501341, now seen corresponding path program 1 times [2024-11-19 05:17:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921981879] [2024-11-19 05:17:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:29,749 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-19 05:17:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921981879] [2024-11-19 05:17:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921981879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:17:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770821408] [2024-11-19 05:17:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:29,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:17:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:17:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:17:29,753 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-19 05:17:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:29,842 INFO L93 Difference]: Finished difference Result 740 states and 1062 transitions. [2024-11-19 05:17:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:17:29,843 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-19 05:17:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:29,844 INFO L225 Difference]: With dead ends: 740 [2024-11-19 05:17:29,845 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 05:17:29,846 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-19 05:17:29,847 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 05:17:29,847 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-19 05:17:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 05:17:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-19 05:17:29,859 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-19 05:17:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-19 05:17:29,861 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 86 [2024-11-19 05:17:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:29,862 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-19 05:17:29,863 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-19 05:17:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-19 05:17:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 05:17:29,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:29,865 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-19 05:17:29,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:17:29,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1955782545, now seen corresponding path program 1 times [2024-11-19 05:17:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675391129] [2024-11-19 05:17:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:30,102 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-19 05:17:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675391129] [2024-11-19 05:17:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675391129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:30,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:17:30,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677602223] [2024-11-19 05:17:30,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:17:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:30,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:17:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:17:30,110 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-19 05:17:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:30,212 INFO L93 Difference]: Finished difference Result 949 states and 1335 transitions. [2024-11-19 05:17:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:17:30,213 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-19 05:17:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:30,216 INFO L225 Difference]: With dead ends: 949 [2024-11-19 05:17:30,216 INFO L226 Difference]: Without dead ends: 602 [2024-11-19 05:17:30,219 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-19 05:17:30,221 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-19 05:17:30,222 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-19 05:17:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-19 05:17:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2024-11-19 05:17:30,241 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-19 05:17:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-11-19 05:17:30,243 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 86 [2024-11-19 05:17:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:30,246 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-11-19 05:17:30,246 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-19 05:17:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-11-19 05:17:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 05:17:30,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:30,249 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-19 05:17:30,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:17:30,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:30,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1837254023, now seen corresponding path program 1 times [2024-11-19 05:17:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133215874] [2024-11-19 05:17:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:30,726 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-19 05:17:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133215874] [2024-11-19 05:17:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133215874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:17:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281692399] [2024-11-19 05:17:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:17:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:30,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:17:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:17:30,732 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 4 states, 4 states have (on average 23.25) 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-19 05:17:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:30,837 INFO L93 Difference]: Finished difference Result 880 states and 1243 transitions. [2024-11-19 05:17:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:17:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) 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-19 05:17:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:30,844 INFO L225 Difference]: With dead ends: 880 [2024-11-19 05:17:30,844 INFO L226 Difference]: Without dead ends: 876 [2024-11-19 05:17:30,845 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-19 05:17:30,846 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 458 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1380 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-19 05:17:30,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1380 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:17:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-19 05:17:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 600. [2024-11-19 05:17:30,865 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-19 05:17:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 847 transitions. [2024-11-19 05:17:30,868 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 847 transitions. Word has length 101 [2024-11-19 05:17:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 847 transitions. [2024-11-19 05:17:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) 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-19 05:17:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 847 transitions. [2024-11-19 05:17:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:17:30,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:30,878 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-19 05:17:30,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:17:30,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 666716360, now seen corresponding path program 1 times [2024-11-19 05:17:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596172612] [2024-11-19 05:17:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:31,281 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-19 05:17:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596172612] [2024-11-19 05:17:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596172612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:17:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407112223] [2024-11-19 05:17:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:31,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:17:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:17:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:17:31,287 INFO L87 Difference]: Start difference. First operand 600 states and 847 transitions. Second operand has 4 states, 4 states have (on average 36.75) 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-19 05:17:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:31,381 INFO L93 Difference]: Finished difference Result 865 states and 1227 transitions. [2024-11-19 05:17:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:17:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) 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-19 05:17:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:31,385 INFO L225 Difference]: With dead ends: 865 [2024-11-19 05:17:31,385 INFO L226 Difference]: Without dead ends: 516 [2024-11-19 05:17:31,386 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-19 05:17:31,388 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 30 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1118 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-19 05:17:31,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1118 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:17:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-19 05:17:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-11-19 05:17:31,404 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-19 05:17:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2024-11-19 05:17:31,406 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 155 [2024-11-19 05:17:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:31,407 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2024-11-19 05:17:31,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) 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-19 05:17:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-19 05:17:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:17:31,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:31,410 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-19 05:17:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:17:31,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -504797764, now seen corresponding path program 1 times [2024-11-19 05:17:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563771070] [2024-11-19 05:17:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:31,681 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-19 05:17:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563771070] [2024-11-19 05:17:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563771070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:17:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123759903] [2024-11-19 05:17:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:17:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:17:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:17:31,684 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand has 5 states, 5 states have (on average 29.6) 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-19 05:17:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:32,153 INFO L93 Difference]: Finished difference Result 1288 states and 1731 transitions. [2024-11-19 05:17:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:17:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) 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-19 05:17:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:32,157 INFO L225 Difference]: With dead ends: 1288 [2024-11-19 05:17:32,158 INFO L226 Difference]: Without dead ends: 863 [2024-11-19 05:17:32,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:17:32,159 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1111 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:32,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1396 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:17:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-19 05:17:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 655. [2024-11-19 05:17:32,178 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-19 05:17:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2024-11-19 05:17:32,180 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 155 [2024-11-19 05:17:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:32,181 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2024-11-19 05:17:32,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) 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-19 05:17:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2024-11-19 05:17:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:17:32,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:32,185 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-19 05:17:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:17:32,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:32,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1095915632, now seen corresponding path program 1 times [2024-11-19 05:17:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:32,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402340494] [2024-11-19 05:17:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:32,975 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-19 05:17:32,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:32,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402340494] [2024-11-19 05:17:32,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402340494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:17:32,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701242384] [2024-11-19 05:17:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:32,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:17:32,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:17:32,979 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-19 05:17:32,981 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-19 05:17:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:33,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 05:17:33,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:17:33,403 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-19 05:17:33,684 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-19 05:17:33,693 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-19 05:17:33,703 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-19 05:17:33,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:17:33,909 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-19 05:17:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701242384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:17:33,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:17:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:17:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704267002] [2024-11-19 05:17:33,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:17:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:17:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:17:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:17:33,913 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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-19 05:17:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:34,308 INFO L93 Difference]: Finished difference Result 2929 states and 3955 transitions. [2024-11-19 05:17:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:17:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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-19 05:17:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:34,320 INFO L225 Difference]: With dead ends: 2929 [2024-11-19 05:17:34,320 INFO L226 Difference]: Without dead ends: 2522 [2024-11-19 05:17:34,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:17:34,323 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 2236 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:34,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 3548 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:17:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-19 05:17:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1002. [2024-11-19 05:17:34,377 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-19 05:17:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1345 transitions. [2024-11-19 05:17:34,382 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1345 transitions. Word has length 165 [2024-11-19 05:17:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:34,383 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1345 transitions. [2024-11-19 05:17:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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-19 05:17:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1345 transitions. [2024-11-19 05:17:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:17:34,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:34,389 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-19 05:17:34,416 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-19 05:17:34,593 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-19 05:17:34,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:34,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 880262263, now seen corresponding path program 1 times [2024-11-19 05:17:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170953694] [2024-11-19 05:17:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:38,461 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-19 05:17:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170953694] [2024-11-19 05:17:38,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170953694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:17:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900464154] [2024-11-19 05:17:38,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:38,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:17:38,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:17:38,465 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-19 05:17:38,466 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-19 05:17:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:39,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:17:39,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:17:39,220 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-19 05:17:39,418 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-19 05:17:39,528 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-19 05:17:39,636 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-19 05:17:39,802 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-19 05:17:39,808 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-19 05:17:39,813 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-19 05:17:39,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:17:40,367 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-19 05:17:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900464154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:17:40,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:17:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2024-11-19 05:17:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66899933] [2024-11-19 05:17:40,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:17:40,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 05:17:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 05:17:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-11-19 05:17:40,373 INFO L87 Difference]: Start difference. First operand 1002 states and 1345 transitions. Second operand has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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-19 05:17:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:41,087 INFO L93 Difference]: Finished difference Result 6217 states and 8404 transitions. [2024-11-19 05:17:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:17:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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-19 05:17:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:41,111 INFO L225 Difference]: With dead ends: 6217 [2024-11-19 05:17:41,111 INFO L226 Difference]: Without dead ends: 5810 [2024-11-19 05:17:41,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 778 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:17:41,120 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 7367 mSDsluCounter, 5335 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7377 SdHoareTripleChecker+Valid, 5762 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:41,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7377 Valid, 5762 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:17:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2024-11-19 05:17:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 1866. [2024-11-19 05:17:41,227 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-19 05:17:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2503 transitions. [2024-11-19 05:17:41,235 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2503 transitions. Word has length 393 [2024-11-19 05:17:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:41,236 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2503 transitions. [2024-11-19 05:17:41,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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-19 05:17:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2503 transitions. [2024-11-19 05:17:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:17:41,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:41,255 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-19 05:17:41,278 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-19 05:17:41,459 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-19 05:17:41,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:41,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash -121035259, now seen corresponding path program 2 times [2024-11-19 05:17:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214562932] [2024-11-19 05:17:41,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:17:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:41,794 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:17:41,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:17:42,139 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-19 05:17:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214562932] [2024-11-19 05:17:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214562932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:17:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102485262] [2024-11-19 05:17:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:42,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:17:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:17:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:17:42,142 INFO L87 Difference]: Start difference. First operand 1866 states and 2503 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-19 05:17:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:42,577 INFO L93 Difference]: Finished difference Result 2303 states and 3093 transitions. [2024-11-19 05:17:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:17:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-19 05:17:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:42,586 INFO L225 Difference]: With dead ends: 2303 [2024-11-19 05:17:42,586 INFO L226 Difference]: Without dead ends: 1899 [2024-11-19 05:17:42,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:17:42,588 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 20 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:42,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1930 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:17:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-19 05:17:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1878. [2024-11-19 05:17:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1862 states have (on average 1.3378088077336197) internal successors, (2491), 1863 states have internal predecessors, (2491), 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-19 05:17:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2515 transitions. [2024-11-19 05:17:42,656 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2515 transitions. Word has length 849 [2024-11-19 05:17:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:42,657 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2515 transitions. [2024-11-19 05:17:42,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-19 05:17:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2515 transitions. [2024-11-19 05:17:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:17:42,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:42,680 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-19 05:17:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:17:42,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1393635768, now seen corresponding path program 1 times [2024-11-19 05:17:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352232381] [2024-11-19 05:17:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:45,619 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-19 05:17:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352232381] [2024-11-19 05:17:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352232381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:17:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464538558] [2024-11-19 05:17:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:17:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:17:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:17:45,622 INFO L87 Difference]: Start difference. First operand 1878 states and 2515 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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-19 05:17:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:46,021 INFO L93 Difference]: Finished difference Result 2339 states and 3135 transitions. [2024-11-19 05:17:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:17:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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 850 [2024-11-19 05:17:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:46,031 INFO L225 Difference]: With dead ends: 2339 [2024-11-19 05:17:46,032 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:17:46,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:17:46,034 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 25 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:46,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1973 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:17:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:17:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1890. [2024-11-19 05:17:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1874 states have (on average 1.3372465314834578) internal successors, (2506), 1875 states have internal predecessors, (2506), 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-19 05:17:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2530 transitions. [2024-11-19 05:17:46,110 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2530 transitions. Word has length 850 [2024-11-19 05:17:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:46,113 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2530 transitions. [2024-11-19 05:17:46,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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-19 05:17:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2530 transitions. [2024-11-19 05:17:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:17:46,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:46,124 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, 1] [2024-11-19 05:17:46,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:17:46,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:46,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1960083759, now seen corresponding path program 1 times [2024-11-19 05:17:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940740463] [2024-11-19 05:17:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:49,126 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-19 05:17:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940740463] [2024-11-19 05:17:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940740463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:17:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258406972] [2024-11-19 05:17:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:17:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:17:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:17:49,130 INFO L87 Difference]: Start difference. First operand 1890 states and 2530 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:17:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:49,658 INFO L93 Difference]: Finished difference Result 2351 states and 3156 transitions. [2024-11-19 05:17:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:17:49,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:17:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:49,667 INFO L225 Difference]: With dead ends: 2351 [2024-11-19 05:17:49,668 INFO L226 Difference]: Without dead ends: 1923 [2024-11-19 05:17:49,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:17:49,670 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 32 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:49,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2659 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 05:17:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2024-11-19 05:17:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1914. [2024-11-19 05:17:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1898 states have (on average 1.3361433087460484) internal successors, (2536), 1899 states have internal predecessors, (2536), 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-19 05:17:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2560 transitions. [2024-11-19 05:17:49,736 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2560 transitions. Word has length 851 [2024-11-19 05:17:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:49,737 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2560 transitions. [2024-11-19 05:17:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:17:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2560 transitions. [2024-11-19 05:17:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:17:49,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:49,745 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, 1] [2024-11-19 05:17:49,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:17:49,746 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1735359702, now seen corresponding path program 1 times [2024-11-19 05:17:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461879350] [2024-11-19 05:17:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:17:52,216 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-19 05:17:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:17:52,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461879350] [2024-11-19 05:17:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461879350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:17:52,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:17:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:17:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079370188] [2024-11-19 05:17:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:17:52,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:17:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:17:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:17:52,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:17:52,219 INFO L87 Difference]: Start difference. First operand 1914 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:17:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:17:52,530 INFO L93 Difference]: Finished difference Result 2393 states and 3198 transitions. [2024-11-19 05:17:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:17:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:17:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:17:52,539 INFO L225 Difference]: With dead ends: 2393 [2024-11-19 05:17:52,539 INFO L226 Difference]: Without dead ends: 1941 [2024-11-19 05:17:52,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:17:52,542 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 15 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:17:52,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1658 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:17:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2024-11-19 05:17:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1923. [2024-11-19 05:17:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1907 states have (on average 1.3345568956476141) internal successors, (2545), 1908 states have internal predecessors, (2545), 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-19 05:17:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2569 transitions. [2024-11-19 05:17:52,616 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2569 transitions. Word has length 851 [2024-11-19 05:17:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:17:52,618 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2569 transitions. [2024-11-19 05:17:52,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:17:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2569 transitions. [2024-11-19 05:17:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:17:52,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:17:52,626 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, 1, 1] [2024-11-19 05:17:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:17:52,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:17:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:17:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1374014853, now seen corresponding path program 1 times [2024-11-19 05:17:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:17:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032825090] [2024-11-19 05:17:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:17:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:17:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:18:02,040 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-19 05:18:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:18:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032825090] [2024-11-19 05:18:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032825090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:18:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918165279] [2024-11-19 05:18:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:18:02,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:18:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:18:02,044 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-19 05:18:02,046 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-19 05:18:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:18:03,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 4158 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 05:18:03,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:18:03,516 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-19 05:18:03,696 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-19 05:18:03,792 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-19 05:18:03,905 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-19 05:18:04,011 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-19 05:18:04,112 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-19 05:18:04,206 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-19 05:18:04,292 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-19 05:18:04,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-19 05:18:04,463 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-19 05:18:04,568 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-19 05:18:04,572 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-19 05:18:04,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-19 05:18:04,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:18:05,691 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-19 05:18:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918165279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:18:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:18:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 32 [2024-11-19 05:18:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527527684] [2024-11-19 05:18:05,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:18:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 05:18:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:18:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 05:18:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=582, Unknown=0, NotChecked=0, Total=992 [2024-11-19 05:18:05,701 INFO L87 Difference]: Start difference. First operand 1923 states and 2569 transitions. Second operand has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 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-19 05:18:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:18:07,635 INFO L93 Difference]: Finished difference Result 14123 states and 18842 transitions. [2024-11-19 05:18:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 05:18:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 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 852 [2024-11-19 05:18:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:18:07,680 INFO L225 Difference]: With dead ends: 14123 [2024-11-19 05:18:07,681 INFO L226 Difference]: Without dead ends: 13659 [2024-11-19 05:18:07,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1739 GetRequests, 1688 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 05:18:07,688 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 22280 mSDsluCounter, 10128 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22302 SdHoareTripleChecker+Valid, 10554 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:18:07,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22302 Valid, 10554 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:18:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2024-11-19 05:18:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 3651. [2024-11-19 05:18:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3623 states have (on average 1.33508142423406) internal successors, (4837), 3624 states have internal predecessors, (4837), 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-19 05:18:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4885 transitions. [2024-11-19 05:18:07,868 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4885 transitions. Word has length 852 [2024-11-19 05:18:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:18:07,870 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4885 transitions. [2024-11-19 05:18:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 53.21875) internal successors, (1703), 32 states have internal predecessors, (1703), 3 states have call successors, (6), 2 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-19 05:18:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4885 transitions. [2024-11-19 05:18:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:18:07,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:18:07,893 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, 1, 1] [2024-11-19 05:18:07,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 05:18:08,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:18:08,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:18:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:18:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1807879201, now seen corresponding path program 2 times [2024-11-19 05:18:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:18:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43825692] [2024-11-19 05:18:08,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:18:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:18:08,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:18:08,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:18:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17562 trivial. 0 not checked. [2024-11-19 05:18:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:18:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43825692] [2024-11-19 05:18:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43825692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:18:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:18:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:18:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373476657] [2024-11-19 05:18:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:18:08,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:18:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:18:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:18:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:18:08,856 INFO L87 Difference]: Start difference. First operand 3651 states and 4885 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-19 05:18:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:18:09,261 INFO L93 Difference]: Finished difference Result 4311 states and 5753 transitions. [2024-11-19 05:18:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:18:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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 1764 [2024-11-19 05:18:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:18:09,273 INFO L225 Difference]: With dead ends: 4311 [2024-11-19 05:18:09,273 INFO L226 Difference]: Without dead ends: 3850 [2024-11-19 05:18:09,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:18:09,276 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 436 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:18:09,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1889 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:18:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2024-11-19 05:18:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3686. [2024-11-19 05:18:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3658 states have (on average 1.3329688354291962) internal successors, (4876), 3659 states have internal predecessors, (4876), 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-19 05:18:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4924 transitions. [2024-11-19 05:18:09,394 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4924 transitions. Word has length 1764 [2024-11-19 05:18:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:18:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4924 transitions. [2024-11-19 05:18:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-19 05:18:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4924 transitions. [2024-11-19 05:18:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2024-11-19 05:18:09,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:18:09,419 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, 1, 1] [2024-11-19 05:18:09,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:18:09,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:18:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:18:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1705966899, now seen corresponding path program 1 times [2024-11-19 05:18:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:18:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105179946] [2024-11-19 05:18:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:18:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:18:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat