./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:36:31,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:36:31,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:36:31,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:36:31,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:36:31,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:36:31,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:36:31,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:36:31,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:36:31,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:36:31,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:36:31,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:36:31,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:36:31,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:36:31,603 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:36:31,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:36:31,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:36:31,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:36:31,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:36:31,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:36:31,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:36:31,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:36:31,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:36:31,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:36:31,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:36:31,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:36:31,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:36:31,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:36:31,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:36:31,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:36:31,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:36:31,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:36:31,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:31,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:36:31,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:36:31,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:36:31,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:36:31,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:36:31,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:36:31,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:36:31,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:36:31,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:36:31,613 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-10-11 01:36:31,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:36:31,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:36:31,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:36:31,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:36:31,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:36:31,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-10-11 01:36:33,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:36:33,774 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:36:33,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-10-11 01:36:33,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/95c0ed1ef/4da316ca6bd94dae9d7f3dde995f5196/FLAG7546a3262 [2024-10-11 01:36:33,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/95c0ed1ef/4da316ca6bd94dae9d7f3dde995f5196 [2024-10-11 01:36:33,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:36:33,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:36:33,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:33,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:36:33,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:36:33,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:33" (1/1) ... [2024-10-11 01:36:33,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2088ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:33, skipping insertion in model container [2024-10-11 01:36:33,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:33" (1/1) ... [2024-10-11 01:36:33,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:36:34,153 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2024-10-11 01:36:34,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:34,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:36:34,241 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2024-10-11 01:36:34,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:36:34,295 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:36:34,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34 WrapperNode [2024-10-11 01:36:34,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:36:34,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:34,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:36:34,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:36:34,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,365 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2024-10-11 01:36:34,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:36:34,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:36:34,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:36:34,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:36:34,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,427 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 18, 8, 8, 6]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-10-11 01:36:34,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:36:34,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:36:34,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:36:34,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:36:34,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (1/1) ... [2024-10-11 01:36:34,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:36:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:34,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:36:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:36:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 01:36:34,599 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:36:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-10-11 01:36:34,601 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:36:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-10-11 01:36:34,602 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:36:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:36:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 01:36:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 01:36:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-10-11 01:36:34,603 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-10-11 01:36:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:36:34,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:36:34,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:36:34,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:36:35,138 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-11 01:36:35,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:36:35,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:36:35,193 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-11 01:36:35,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:35 BoogieIcfgContainer [2024-10-11 01:36:35,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:36:35,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:36:35,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:36:35,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:36:35,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:33" (1/3) ... [2024-10-11 01:36:35,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a844dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:35, skipping insertion in model container [2024-10-11 01:36:35,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:34" (2/3) ... [2024-10-11 01:36:35,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a844dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:35, skipping insertion in model container [2024-10-11 01:36:35,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:35" (3/3) ... [2024-10-11 01:36:35,203 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-10-11 01:36:35,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:36:35,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:36:35,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:36:35,289 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;@39820ddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:36:35,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:36:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 69 states have (on average 1.710144927536232) internal successors, (118), 75 states have internal predecessors, (118), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:36:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:36:35,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:35,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:35,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:35,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 104631669, now seen corresponding path program 1 times [2024-10-11 01:36:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:35,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138038234] [2024-10-11 01:36:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:35,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:36:35,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138038234] [2024-10-11 01:36:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138038234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:36:35,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:36:35,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:36:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702067036] [2024-10-11 01:36:35,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:36:35,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:36:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:35,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:36:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:35,566 INFO L87 Difference]: Start difference. First operand has 89 states, 69 states have (on average 1.710144927536232) internal successors, (118), 75 states have internal predecessors, (118), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:36:35,626 INFO L93 Difference]: Finished difference Result 176 states and 312 transitions. [2024-10-11 01:36:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:36:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 01:36:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:36:35,639 INFO L225 Difference]: With dead ends: 176 [2024-10-11 01:36:35,639 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 01:36:35,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:36:35,646 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:36:35,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:36:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 01:36:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 01:36:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:36:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2024-10-11 01:36:35,686 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 14 [2024-10-11 01:36:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:36:35,686 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2024-10-11 01:36:35,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:36:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2024-10-11 01:36:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:36:35,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:36:35,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:36:35,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:36:35,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:36:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:36:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2098562303, now seen corresponding path program 1 times [2024-10-11 01:36:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:36:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346365759] [2024-10-11 01:36:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:36:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:36:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:36:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:36:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:36:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:36:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346365759] [2024-10-11 01:36:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346365759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:36:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028718315] [2024-10-11 01:36:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:36:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:36:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:36:36,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:36:36,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:36:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:36:36,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 01:36:36,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:36:37,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:36:37,135 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 24 treesize of output 16 [2024-10-11 01:36:37,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:36:37,214 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 16 treesize of output 8 [2024-10-11 01:36:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:36:37,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:36:37,266 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 34 treesize of output 30 [2024-10-11 01:36:37,383 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 30 treesize of output 26 [2024-10-11 01:36:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:36:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028718315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:36:37,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:36:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 12 [2024-10-11 01:36:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434354568] [2024-10-11 01:36:37,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:36:37,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:36:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:36:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:36:37,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:36:37,436 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:36:41,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:36:45,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:36:49,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:36:53,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:36:57,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:01,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:37:02,306 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2024-10-11 01:37:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 01:37:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-11 01:37:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:37:02,310 INFO L225 Difference]: With dead ends: 109 [2024-10-11 01:37:02,311 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 01:37:02,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:37:02,312 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 36 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:37:02,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 389 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 617 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-10-11 01:37:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 01:37:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2024-10-11 01:37:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 85 states have internal predecessors, (96), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:37:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2024-10-11 01:37:02,348 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 32 [2024-10-11 01:37:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:37:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2024-10-11 01:37:02,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:37:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2024-10-11 01:37:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 01:37:02,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:37:02,350 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:37:02,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:37:02,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:37:02,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:37:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:37:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1922953879, now seen corresponding path program 1 times [2024-10-11 01:37:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:37:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565048562] [2024-10-11 01:37:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:37:02,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:37:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:37:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:37:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:37:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:37:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:37:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565048562] [2024-10-11 01:37:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565048562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:37:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523347759] [2024-10-11 01:37:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:37:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:37:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:37:03,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:37:03,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:37:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:03,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 01:37:03,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:37:03,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:37:03,295 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 24 treesize of output 16 [2024-10-11 01:37:03,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:37:03,412 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 16 treesize of output 8 [2024-10-11 01:37:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:37:03,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:37:03,459 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 34 treesize of output 30 [2024-10-11 01:37:03,519 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 30 treesize of output 26 [2024-10-11 01:37:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:37:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523347759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:37:03,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:37:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 12 [2024-10-11 01:37:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626324587] [2024-10-11 01:37:03,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:37:03,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:37:03,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:37:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:37:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:37:03,538 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:37:07,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:11,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:15,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:19,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:23,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:37:24,187 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2024-10-11 01:37:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 01:37:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-10-11 01:37:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:37:24,189 INFO L225 Difference]: With dead ends: 112 [2024-10-11 01:37:24,189 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 01:37:24,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:37:24,194 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 147 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 32 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:37:24,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 352 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 549 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2024-10-11 01:37:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 01:37:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-10-11 01:37:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.225) internal successors, (98), 88 states have internal predecessors, (98), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:37:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-10-11 01:37:24,223 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 34 [2024-10-11 01:37:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:37:24,224 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-10-11 01:37:24,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:37:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-10-11 01:37:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 01:37:24,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:37:24,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:37:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:37:24,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:37:24,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:37:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:37:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1639693013, now seen corresponding path program 1 times [2024-10-11 01:37:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:37:24,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755472095] [2024-10-11 01:37:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:37:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:37:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:37:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:37:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:37:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:37:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:37:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755472095] [2024-10-11 01:37:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755472095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:37:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435108930] [2024-10-11 01:37:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:37:25,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:37:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:37:25,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:37:25,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:37:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:37:25,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 01:37:25,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:37:25,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 01:37:26,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 01:37:26,105 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 20 treesize of output 12 [2024-10-11 01:37:26,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:37:26,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:37:26,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 01:37:26,327 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 50 treesize of output 23 [2024-10-11 01:37:26,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:37:26,474 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 51 treesize of output 35 [2024-10-11 01:37:26,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:37:26,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 01:37:26,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-10-11 01:37:31,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:37:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2024-10-11 01:37:32,020 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:37:32,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 01:37:32,297 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 34 treesize of output 22 [2024-10-11 01:37:32,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:37:32,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 59 [2024-10-11 01:37:32,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:37:32,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 01:37:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:37:32,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:37:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435108930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:37:32,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:37:32,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2024-10-11 01:37:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071727242] [2024-10-11 01:37:32,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:37:32,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 01:37:32,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:37:32,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 01:37:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1224, Unknown=1, NotChecked=0, Total=1332 [2024-10-11 01:37:32,769 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 36 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 29 states have internal predecessors, (57), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:37:36,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:40,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:45,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:49,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:53,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:37:58,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:38:03,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:38:07,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:38:12,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]