./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_dijkstra-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_dijkstra-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0464cc7a685168b5fc1a1b0dd8da6141b4b98c7c538345750bda8185cd005644 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:10:00,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:10:00,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:10:00,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:10:00,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:10:01,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:10:01,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:10:01,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:10:01,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:10:01,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:10:01,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:10:01,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:10:01,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:10:01,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:10:01,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:10:01,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:10:01,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:10:01,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:10:01,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:10:01,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:10:01,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:10:01,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:10:01,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:10:01,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:10:01,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:10:01,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:10:01,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:10:01,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:10:01,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:10:01,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:10:01,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:10:01,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:10:01,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:10:01,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:10:01,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:10:01,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:10:01,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:10:01,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:10:01,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:10:01,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:10:01,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:10:01,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:10:01,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0464cc7a685168b5fc1a1b0dd8da6141b4b98c7c538345750bda8185cd005644 [2024-10-24 01:10:01,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:10:01,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:10:01,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:10:01,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:10:01,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:10:01,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_dijkstra-u.c [2024-10-24 01:10:02,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:10:02,964 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:10:02,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_dijkstra-u.c [2024-10-24 01:10:02,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f2ddc5d/c077aaacf511403abf94a82e6252cd97/FLAG507b923b2 [2024-10-24 01:10:03,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f2ddc5d/c077aaacf511403abf94a82e6252cd97 [2024-10-24 01:10:03,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:10:03,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:10:03,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:10:03,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:10:03,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:10:03,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8564f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03, skipping insertion in model container [2024-10-24 01:10:03,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:10:03,521 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_dijkstra-u.c[1076,1089] [2024-10-24 01:10:03,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:10:03,571 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:10:03,584 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_dijkstra-u.c[1076,1089] [2024-10-24 01:10:03,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:10:03,623 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:10:03,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03 WrapperNode [2024-10-24 01:10:03,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:10:03,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:10:03,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:10:03,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:10:03,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,664 INFO L138 Inliner]: procedures = 17, calls = 173, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2024-10-24 01:10:03,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:10:03,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:10:03,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:10:03,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:10:03,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,698 INFO L175 MemorySlicer]: Split 139 memory accesses to 6 slices as follows [21, 2, 30, 29, 22, 35]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0]. The 11 writes are split as follows [1, 0, 2, 3, 2, 3]. [2024-10-24 01:10:03,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:10:03,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:10:03,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:10:03,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:10:03,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (1/1) ... [2024-10-24 01:10:03,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:10:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:10:03,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:10:03,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:10:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:10:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_33_0 [2024-10-24 01:10:03,824 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_33_0 [2024-10-24 01:10:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:10:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 01:10:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 01:10:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 01:10:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 01:10:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 01:10:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 01:10:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 01:10:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 01:10:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 01:10:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 01:10:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 01:10:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 01:10:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_37_to_53_0 [2024-10-24 01:10:03,828 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_37_to_53_0 [2024-10-24 01:10:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:10:03,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:10:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 01:10:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 01:10:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 01:10:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 01:10:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 01:10:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 01:10:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 01:10:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 01:10:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 01:10:04,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:10:04,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:10:04,366 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 01:10:04,367 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:10:04,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:10:04,403 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 01:10:04,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:10:04 BoogieIcfgContainer [2024-10-24 01:10:04,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:10:04,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:10:04,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:10:04,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:10:04,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:10:03" (1/3) ... [2024-10-24 01:10:04,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d76ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:10:04, skipping insertion in model container [2024-10-24 01:10:04,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:10:03" (2/3) ... [2024-10-24 01:10:04,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d76ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:10:04, skipping insertion in model container [2024-10-24 01:10:04,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:10:04" (3/3) ... [2024-10-24 01:10:04,413 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_dijkstra-u.c [2024-10-24 01:10:04,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:10:04,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:10:04,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:10:04,485 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;@d5e7744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:10:04,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:10:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 01:10:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 01:10:04,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:10:04,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:10:04,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:10:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:10:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1180092585, now seen corresponding path program 1 times [2024-10-24 01:10:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:10:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896694618] [2024-10-24 01:10:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:10:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:10:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:10:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:10:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:10:04,743 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-24 01:10:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:10:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896694618] [2024-10-24 01:10:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896694618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:10:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:10:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:10:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277048218] [2024-10-24 01:10:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:10:04,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:10:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:10:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:10:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:10:04,775 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:10:04,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:10:04,972 INFO L93 Difference]: Finished difference Result 90 states and 136 transitions. [2024-10-24 01:10:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:10:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 01:10:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:10:04,983 INFO L225 Difference]: With dead ends: 90 [2024-10-24 01:10:04,983 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 01:10:04,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:10:04,989 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:10:04,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 40 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:10:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 01:10:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-10-24 01:10:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 01:10:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-10-24 01:10:05,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 15 [2024-10-24 01:10:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:10:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-24 01:10:05,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:10:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-10-24 01:10:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 01:10:05,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:10:05,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:10:05,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:10:05,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:10:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:10:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 318761401, now seen corresponding path program 1 times [2024-10-24 01:10:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:10:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423331258] [2024-10-24 01:10:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:10:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:10:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:10:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:10:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:10:06,399 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-24 01:10:06,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:10:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423331258] [2024-10-24 01:10:06,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423331258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:10:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:10:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 01:10:06,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783723388] [2024-10-24 01:10:06,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:10:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:10:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:10:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:10:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:10:06,405 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:10:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:10:07,301 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2024-10-24 01:10:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:10:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 01:10:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:10:07,303 INFO L225 Difference]: With dead ends: 75 [2024-10-24 01:10:07,303 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 01:10:07,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:10:07,307 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:10:07,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:10:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 01:10:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2024-10-24 01:10:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 20 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (24), 19 states have call predecessors, (24), 19 states have call successors, (24) [2024-10-24 01:10:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-10-24 01:10:07,334 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 16 [2024-10-24 01:10:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:10:07,335 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-10-24 01:10:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:10:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-10-24 01:10:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 01:10:07,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:10:07,336 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:10:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:10:07,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:10:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:10:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -210214075, now seen corresponding path program 1 times [2024-10-24 01:10:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:10:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147237085] [2024-10-24 01:10:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:10:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:10:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 01:10:07,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923053736] [2024-10-24 01:10:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:10:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:10:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:10:07,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:10:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:10:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:10:07,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-24 01:10:07,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:10:07,916 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-24 01:10:07,939 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-24 01:10:07,947 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 11 [2024-10-24 01:10:07,955 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-24 01:10:08,294 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-24 01:10:08,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 01:10:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:10:08,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:10:19,738 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-24 01:10:19,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:10:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147237085] [2024-10-24 01:10:19,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 01:10:19,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923053736] [2024-10-24 01:10:19,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923053736] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 01:10:19,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:10:19,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-10-24 01:10:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160165136] [2024-10-24 01:10:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:10:19,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:10:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:10:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:10:19,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=174, Unknown=1, NotChecked=0, Total=210 [2024-10-24 01:10:19,742 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 01:10:23,823 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 [1] [2024-10-24 01:10:27,847 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 [1] [2024-10-24 01:10:31,860 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 [1] [2024-10-24 01:10:35,866 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 [1] [2024-10-24 01:10:39,875 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 [1] [2024-10-24 01:10:43,887 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 [1] [2024-10-24 01:10:45,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-24 01:10:49,336 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 [1] [2024-10-24 01:10:53,353 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 [1] [2024-10-24 01:10:57,361 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 [1] [2024-10-24 01:11:01,376 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 [1] [2024-10-24 01:11:05,381 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 [1] [2024-10-24 01:11:09,422 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int#5| |c_func_to_recursive_line_37_to_53_0_#in~q.base|) |c_func_to_recursive_line_37_to_53_0_#in~q.offset|))) (= (mod (+ (* (select (select |c_#memory_int#4| |c_func_to_recursive_line_37_to_53_0_#in~r.base|) |c_func_to_recursive_line_37_to_53_0_#in~r.offset|) .cse0) (let ((.cse1 (select (select |c_#memory_int#3| |c_func_to_recursive_line_37_to_53_0_#in~p.base|) |c_func_to_recursive_line_37_to_53_0_#in~p.offset|))) (* .cse1 .cse1))) 4294967296) (mod (* (select (select |c_#memory_int#0| |c_func_to_recursive_line_37_to_53_0_#in~n.base|) |c_func_to_recursive_line_37_to_53_0_#in~n.offset|) .cse0) 4294967296))) (forall ((|v_ULTIMATE.start_main_~#n~0#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#r~0#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#n~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#p~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#r~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#p~0#1.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select (select |c_#memory_int#0| |v_ULTIMATE.start_main_~#n~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#n~0#1.offset_BEFORE_CALL_3|)) (.cse4 (let ((.cse7 (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#p~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#p~0#1.offset_BEFORE_CALL_3|))) (* .cse7 .cse7))) (.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_main_~#r~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#r~0#1.offset_BEFORE_CALL_3|))) (or (let ((.cse3 (select (select |c_#memory_int#5| |c_func_to_recursive_line_29_to_33_0_#in~q.base|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_3|))) (= (mod (* .cse2 .cse3) 4294967296) (mod (+ .cse4 (* .cse5 .cse3)) 4294967296))) (not (let ((.cse6 (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_29_to_33_0_#in~q.base|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_3|))) (= (mod (* .cse2 .cse6) 4294967296) (mod (+ .cse4 (* .cse5 .cse6)) 4294967296)))))))) is different from false [2024-10-24 01:11:26,941 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 [1] [2024-10-24 01:11:30,947 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 [1] [2024-10-24 01:11:34,951 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 [1] [2024-10-24 01:11:38,960 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 [1] [2024-10-24 01:11:40,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-24 01:11:42,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]