./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:07:23,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:07:23,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:07:23,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:07:23,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:07:23,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:07:23,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:07:23,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:07:23,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:07:23,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:07:23,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:07:23,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:07:23,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:07:23,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:07:23,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:07:23,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:07:23,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:07:23,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:07:23,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:07:23,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:07:23,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:07:23,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:07:23,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:07:23,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:07:23,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:07:23,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:07:23,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:07:23,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:07:23,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:07:23,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:07:23,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:07:23,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:07:23,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:07:23,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:07:23,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:07:23,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:07:23,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:07:23,914 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 -> d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 [2024-10-11 03:07:24,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:07:24,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:07:24,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:07:24,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:07:24,234 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:07:24,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-10-11 03:07:25,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:07:25,729 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:07:25,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-10-11 03:07:25,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eafc48d1b/a3682d8d5ff2418495cbca4a91184ddc/FLAG54e086abc [2024-10-11 03:07:26,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eafc48d1b/a3682d8d5ff2418495cbca4a91184ddc [2024-10-11 03:07:26,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:07:26,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:07:26,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:07:26,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:07:26,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:07:26,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37603131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26, skipping insertion in model container [2024-10-11 03:07:26,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:07:26,311 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/recursified_nla-digbench/recursified_bresenham-ll.c[1137,1150] [2024-10-11 03:07:26,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:07:26,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:07:26,358 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/recursified_nla-digbench/recursified_bresenham-ll.c[1137,1150] [2024-10-11 03:07:26,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:07:26,398 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:07:26,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26 WrapperNode [2024-10-11 03:07:26,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:07:26,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:07:26,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:07:26,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:07:26,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,435 INFO L138 Inliner]: procedures = 16, calls = 76, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2024-10-11 03:07:26,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:07:26,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:07:26,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:07:26,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:07:26,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,459 INFO L175 MemorySlicer]: Split 46 memory accesses to 8 slices as follows [2, 4, 4, 8, 8, 6, 7, 7]. 17 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0]. The 13 writes are split as follows [0, 2, 2, 3, 1, 2, 2, 1]. [2024-10-11 03:07:26,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:07:26,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:07:26,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:07:26,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:07:26,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (1/1) ... [2024-10-11 03:07:26,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:07:26,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:26,515 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 03:07:26,542 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 03:07:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:07:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:07:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 03:07:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 03:07:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 03:07:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 03:07:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 03:07:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 03:07:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:07:26,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:07:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 03:07:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 03:07:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_41_0 [2024-10-11 03:07:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_41_0 [2024-10-11 03:07:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 03:07:26,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 03:07:26,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 03:07:26,716 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:07:26,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:07:26,913 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 03:07:26,913 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:07:26,945 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:07:26,947 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:07:26,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:07:26 BoogieIcfgContainer [2024-10-11 03:07:26,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:07:26,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:07:26,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:07:26,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:07:26,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:07:26" (1/3) ... [2024-10-11 03:07:26,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8d3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:07:26, skipping insertion in model container [2024-10-11 03:07:26,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:07:26" (2/3) ... [2024-10-11 03:07:26,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8d3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:07:26, skipping insertion in model container [2024-10-11 03:07:26,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:07:26" (3/3) ... [2024-10-11 03:07:26,956 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_bresenham-ll.c [2024-10-11 03:07:26,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:07:26,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:07:27,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:07:27,023 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;@270a7e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:07:27,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:07:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 03:07:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 03:07:27,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:27,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:27,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:27,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash -56389801, now seen corresponding path program 1 times [2024-10-11 03:07:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906468] [2024-10-11 03:07:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 03:07:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076053427] [2024-10-11 03:07:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:27,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:27,211 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 03:07:27,212 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 03:07:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:27,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-11 03:07:27,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:27,378 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 03:07:27,386 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 03:07:27,392 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 03:07:27,399 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 25 treesize of output 19 [2024-10-11 03:07:27,408 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 03:07:27,515 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 27 treesize of output 19 [2024-10-11 03:07:27,523 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 23 treesize of output 15 [2024-10-11 03:07:27,529 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 19 treesize of output 11 [2024-10-11 03:07:27,616 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 03:07:27,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:07:27,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:27,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906468] [2024-10-11 03:07:27,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 03:07:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076053427] [2024-10-11 03:07:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076053427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:07:27,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:07:27,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:07:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413610777] [2024-10-11 03:07:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:07:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:07:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:07:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:07:27,647 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 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 03:07:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:27,861 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-10-11 03:07:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:07:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 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 8 [2024-10-11 03:07:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:27,870 INFO L225 Difference]: With dead ends: 55 [2024-10-11 03:07:27,870 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 03:07:27,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:07:27,878 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:27,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 75 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 03:07:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-11 03:07:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 03:07:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-11 03:07:27,908 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 8 [2024-10-11 03:07:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-11 03:07:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 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 03:07:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-11 03:07:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 03:07:27,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:27,910 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:27,924 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 03:07:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 03:07:28,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 11856504, now seen corresponding path program 1 times [2024-10-11 03:07:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151512413] [2024-10-11 03:07:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 03:07:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409420753] [2024-10-11 03:07:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:28,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:28,232 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 03:07:28,233 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 03:07:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:28,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 03:07:28,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:28,338 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 25 treesize of output 19 [2024-10-11 03:07:28,344 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 03:07:28,350 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 03:07:28,373 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 19 treesize of output 15 [2024-10-11 03:07:28,441 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 27 treesize of output 19 [2024-10-11 03:07:28,446 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 23 treesize of output 15 [2024-10-11 03:07:28,450 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 19 treesize of output 11 [2024-10-11 03:07:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:07:28,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:07:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151512413] [2024-10-11 03:07:28,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 03:07:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409420753] [2024-10-11 03:07:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409420753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:07:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:07:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:07:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154417477] [2024-10-11 03:07:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:07:28,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:07:28,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:28,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:07:28,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:07:28,488 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:07:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:28,602 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 03:07:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:07:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-11 03:07:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:28,604 INFO L225 Difference]: With dead ends: 41 [2024-10-11 03:07:28,604 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 03:07:28,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:07:28,606 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:28,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:07:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 03:07:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 03:07:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 03:07:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-11 03:07:28,612 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2024-10-11 03:07:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:28,613 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-11 03:07:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:07:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-11 03:07:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 03:07:28,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:28,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:28,628 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 03:07:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:28,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 12842250, now seen corresponding path program 1 times [2024-10-11 03:07:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393530558] [2024-10-11 03:07:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 03:07:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452209112] [2024-10-11 03:07:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:28,923 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 03:07:28,924 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 03:07:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:29,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-11 03:07:29,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:29,058 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 03:07:29,069 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 03:07:29,074 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 03:07:29,076 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 03:07:29,079 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 25 treesize of output 19 [2024-10-11 03:07:29,273 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 43 treesize of output 31 [2024-10-11 03:07:33,461 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 19 treesize of output 11 [2024-10-11 03:07:33,597 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 27 treesize of output 19 [2024-10-11 03:07:33,611 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 23 treesize of output 15 [2024-10-11 03:07:33,621 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 26 treesize of output 14 [2024-10-11 03:07:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:07:33,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:07:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:34,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393530558] [2024-10-11 03:07:34,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 03:07:34,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452209112] [2024-10-11 03:07:34,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452209112] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:07:34,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:07:34,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-10-11 03:07:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380358168] [2024-10-11 03:07:34,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:34,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:07:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:34,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:07:34,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=230, Unknown=1, NotChecked=0, Total=272 [2024-10-11 03:07:34,388 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:07:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:35,423 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-11 03:07:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:07:35,424 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 03:07:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:35,426 INFO L225 Difference]: With dead ends: 52 [2024-10-11 03:07:35,426 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 03:07:35,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=103, Invalid=546, Unknown=1, NotChecked=0, Total=650 [2024-10-11 03:07:35,429 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:35,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 110 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:07:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 03:07:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-10-11 03:07:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 03:07:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-11 03:07:35,449 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2024-10-11 03:07:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:35,449 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-11 03:07:35,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:07:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-10-11 03:07:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 03:07:35,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:35,450 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:35,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:35,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:35,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:35,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 405669074, now seen corresponding path program 1 times [2024-10-11 03:07:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:35,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635463444] [2024-10-11 03:07:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 03:07:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993384759] [2024-10-11 03:07:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:35,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:35,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:07:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:35,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-11 03:07:35,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:35,932 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 03:07:35,937 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 25 treesize of output 19 [2024-10-11 03:07:35,943 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 03:07:35,951 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 03:07:35,987 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 03:07:36,007 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 19 treesize of output 15 [2024-10-11 03:07:36,537 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 11 treesize of output 7 [2024-10-11 03:07:36,917 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 19 treesize of output 11 [2024-10-11 03:07:36,930 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 52 treesize of output 36 [2024-10-11 03:07:37,006 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 37 treesize of output 21 [2024-10-11 03:07:37,013 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 17 treesize of output 9 [2024-10-11 03:07:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:07:37,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:07:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:07:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635463444] [2024-10-11 03:07:38,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 03:07:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993384759] [2024-10-11 03:07:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993384759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:07:38,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:07:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-10-11 03:07:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679720680] [2024-10-11 03:07:38,677 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 03:07:38,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:07:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:07:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:07:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:07:38,679 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 19 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 03:07:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:07:39,319 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-11 03:07:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:07:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2024-10-11 03:07:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:07:39,320 INFO L225 Difference]: With dead ends: 55 [2024-10-11 03:07:39,320 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 03:07:39,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:07:39,321 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:07:39,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:07:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 03:07:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 03:07:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 03:07:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-10-11 03:07:39,331 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 32 [2024-10-11 03:07:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:07:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-10-11 03:07:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 03:07:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-10-11 03:07:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 03:07:39,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:07:39,332 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:07:39,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:07:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:39,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:07:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:07:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 828370900, now seen corresponding path program 1 times [2024-10-11 03:07:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:07:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660452679] [2024-10-11 03:07:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:07:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 03:07:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938817531] [2024-10-11 03:07:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:07:39,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:07:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:07:39,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:07:39,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:07:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:07:39,729 WARN L253 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 183 conjuncts are in the unsatisfiable core [2024-10-11 03:07:39,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:07:39,740 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 03:07:39,742 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 03:07:39,744 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 03:07:39,749 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 25 treesize of output 19 [2024-10-11 03:07:39,760 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 03:07:39,778 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 19 treesize of output 15 [2024-10-11 03:07:42,661 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 46 treesize of output 42 [2024-10-11 03:07:42,669 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 50 treesize of output 42 [2024-10-11 03:07:42,674 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 49 treesize of output 41 [2024-10-11 03:08:13,021 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 21 treesize of output 17 [2024-10-11 03:08:13,049 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 21 treesize of output 17 [2024-10-11 03:08:15,995 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 57 treesize of output 42 [2024-10-11 03:08:16,006 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 19 treesize of output 11 [2024-10-11 03:08:16,019 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 19 treesize of output 11 [2024-10-11 03:08:16,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 51 [2024-10-11 03:08:16,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 34 [2024-10-11 03:08:16,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 54 [2024-10-11 03:08:16,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 38 [2024-10-11 03:08:16,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,391 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 107 treesize of output 107 [2024-10-11 03:08:16,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:08:16,438 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 58 treesize of output 74 [2024-10-11 03:08:16,455 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 18 [2024-10-11 03:08:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:08:16,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:08:24,666 WARN L286 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 231 DAG size of output: 216 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-11 03:08:35,280 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 298] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-11 03:08:40,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int#7| |c_func_to_recursive_line_0_to_41_0_#in~X.base|) |c_func_to_recursive_line_0_to_41_0_#in~X.offset|)) (.cse8 (select (select |c_old(#memory_int#6)| |c_func_to_recursive_line_0_to_41_0_#in~x.base|) |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) (.cse10 (forall ((|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7| Int)) (let ((.cse13 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_4|)) (.cse12 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (let ((.cse11 (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_6|))) (+ (* .cse11 2) (* 2 (* .cse11 .cse12)) (* .cse13 2))) (+ (select (select |c_#memory_int#7| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_6|) (* 2 (* .cse13 .cse12)))))))) (and (forall ((|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_6|))) (let ((.cse0 (* .cse2 2)) (.cse4 (select (select |c_#memory_int#7| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7|))) (or (not (let ((.cse1 (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_4|)) (.cse3 (select (select |c_old(#memory_int#6)| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (+ .cse0 (* 2 .cse1) (* 2 (* .cse2 .cse3))) (+ .cse4 (* (* .cse1 .cse3) 2) (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_6|))))) (let ((.cse6 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_4|)) (.cse5 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (+ .cse0 (* 2 (* .cse2 .cse5)) (* .cse6 2)) (+ .cse4 (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_6|) (* 2 (* .cse6 .cse5))))))))) (or (= (let ((.cse7 (select (select |c_#memory_int#4| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|) |c_func_to_recursive_line_0_to_41_0_#in~Y.offset|))) (+ (* 2 .cse7) (* 2 (* .cse7 .cse8)))) (+ .cse9 (* 2 (* .cse9 (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_0_to_41_0_#in~y.base|) |c_func_to_recursive_line_0_to_41_0_#in~y.offset|))) (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_0_to_41_0_#in~v.base|) |c_func_to_recursive_line_0_to_41_0_#in~v.offset|))) .cse10) (or (< .cse9 .cse8) .cse10))) is different from false [2024-10-11 03:08:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:08:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660452679] [2024-10-11 03:08:45,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 03:08:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938817531] [2024-10-11 03:08:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938817531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:08:45,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:08:45,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2024-10-11 03:08:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056110199] [2024-10-11 03:08:45,734 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 03:08:45,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:08:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:08:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:08:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=986, Unknown=9, NotChecked=64, Total=1190 [2024-10-11 03:08:45,738 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 03:08:49,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 03:08:53,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 03:08:57,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 03:09:01,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 03:09:06,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]