./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu --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 fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:12,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:13,073 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:13,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:13,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:13,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:13,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:13,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:13,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:13,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:13,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:13,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:13,133 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:13,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:13,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:13,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:13,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:13,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:13,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:13,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:13,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:13,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:13,140 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:13,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:13,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:13,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:13,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:13,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:13,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:13,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:13,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:13,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:13,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:13,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:13,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:13,148 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:13,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:13,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:13,149 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:13,149 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu 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 -> fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 [2023-11-19 07:45:13,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:13,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:13,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:13,538 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:13,539 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:13,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-19 07:45:16,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:16,762 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:16,762 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-19 07:45:16,769 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/data/e776c75c9/c1f0015a848449bca5472386ddb2b73e/FLAG7cad15e3a [2023-11-19 07:45:16,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/data/e776c75c9/c1f0015a848449bca5472386ddb2b73e [2023-11-19 07:45:16,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:16,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:16,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:16,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:16,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:16,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:16" (1/1) ... [2023-11-19 07:45:16,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a3fd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:16, skipping insertion in model container [2023-11-19 07:45:16,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:16" (1/1) ... [2023-11-19 07:45:16,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:16,992 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-19 07:45:16,999 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-19 07:45:17,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:17,012 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:17,029 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-19 07:45:17,030 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-19 07:45:17,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:17,046 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:17,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17 WrapperNode [2023-11-19 07:45:17,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:17,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:17,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:17,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:17,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,086 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-11-19 07:45:17,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:17,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:17,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:17,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:17,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:17,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:17,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:17,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:17,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (1/1) ... [2023-11-19 07:45:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:17,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:45:17,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2023-11-19 07:45:17,194 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2023-11-19 07:45:17,267 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:17,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:17,441 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:17,448 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:17,449 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:17,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:17 BoogieIcfgContainer [2023-11-19 07:45:17,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:17,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:17,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:17,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:17,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:16" (1/3) ... [2023-11-19 07:45:17,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b22c9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:17, skipping insertion in model container [2023-11-19 07:45:17,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:17" (2/3) ... [2023-11-19 07:45:17,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b22c9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:17, skipping insertion in model container [2023-11-19 07:45:17,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:17" (3/3) ... [2023-11-19 07:45:17,460 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-a.c [2023-11-19 07:45:17,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:17,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:17,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:17,526 INFO L357 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, mHoare=true, 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;@116c1b8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:17,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-19 07:45:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:45:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:45:17,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:17,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:17,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:17,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1751398402, now seen corresponding path program 1 times [2023-11-19 07:45:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230517065] [2023-11-19 07:45:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230517065] [2023-11-19 07:45:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230517065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:18,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46584384] [2023-11-19 07:45:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:18,466 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:45:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:18,574 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-19 07:45:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:18,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-19 07:45:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:18,586 INFO L225 Difference]: With dead ends: 31 [2023-11-19 07:45:18,586 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 07:45:18,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:18,594 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:18,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 07:45:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-19 07:45:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 07:45:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-11-19 07:45:18,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2023-11-19 07:45:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:18,640 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-11-19 07:45:18,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:45:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-11-19 07:45:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:45:18,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:18,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:18,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:18,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:18,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1541220336, now seen corresponding path program 1 times [2023-11-19 07:45:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889356730] [2023-11-19 07:45:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889356730] [2023-11-19 07:45:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889356730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:45:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784376326] [2023-11-19 07:45:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:45:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:45:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:45:19,247 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:45:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:19,391 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-11-19 07:45:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-19 07:45:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:19,393 INFO L225 Difference]: With dead ends: 23 [2023-11-19 07:45:19,393 INFO L226 Difference]: Without dead ends: 18 [2023-11-19 07:45:19,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:45:19,396 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:19,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-19 07:45:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-19 07:45:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:45:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-11-19 07:45:19,403 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2023-11-19 07:45:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:19,404 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-11-19 07:45:19,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:45:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-11-19 07:45:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 07:45:19,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:19,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:19,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:19,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:19,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash -929951269, now seen corresponding path program 1 times [2023-11-19 07:45:19,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:19,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192938662] [2023-11-19 07:45:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:45:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:20,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192938662] [2023-11-19 07:45:20,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192938662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833047982] [2023-11-19 07:45:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:20,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:20,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:20,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:45:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:20,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 07:45:20,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:21,024 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:21,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:45:21,132 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_1 Int) (v_y_1 Int)) (and (<= v_z_1 255) (<= 0 v_z_1) (= |c_#memory_int| (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_1) v_z_1))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_1))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))))) is different from true [2023-11-19 07:45:21,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:21,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2023-11-19 07:45:21,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-11-19 07:45:21,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2023-11-19 07:45:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-19 07:45:21,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:45:21,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_62 (Array Int Int)) (v_z_2 Int) (v_y_2 Int) (|ULTIMATE.start_main_~#v~0#1.offset| Int)) (or (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset| (+ v_z_2 (* 256 v_y_2)))))) (store .cse3 |c_ULTIMATE.start_main_~#s~0#1.base| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset| (+ v_z_2 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_62))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< (+ (* (div .cse0 4294967296) 4294967296) .cse1) (+ (* 256 (div .cse1 256)) .cse0 1)))) (< 255 v_z_2) (< v_z_2 0))) is different from false [2023-11-19 07:45:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833047982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:21,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:45:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-11-19 07:45:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682065894] [2023-11-19 07:45:21,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:45:21,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:45:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:45:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=128, Unknown=2, NotChecked=46, Total=210 [2023-11-19 07:45:21,677 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:45:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:22,149 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-11-19 07:45:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:45:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2023-11-19 07:45:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:22,151 INFO L225 Difference]: With dead ends: 31 [2023-11-19 07:45:22,151 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:45:22,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=249, Unknown=2, NotChecked=66, Total=380 [2023-11-19 07:45:22,153 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:22,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2023-11-19 07:45:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:45:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-11-19 07:45:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:45:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-19 07:45:22,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2023-11-19 07:45:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:22,166 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-19 07:45:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:45:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-19 07:45:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 07:45:22,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:22,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:22,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:45:22,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:22,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:22,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1236285783, now seen corresponding path program 1 times [2023-11-19 07:45:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488926691] [2023-11-19 07:45:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:45:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488926691] [2023-11-19 07:45:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488926691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835870356] [2023-11-19 07:45:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:23,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:23,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:45:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:23,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-19 07:45:23,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:23,417 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:23,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2023-11-19 07:45:23,527 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_3 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_y_3 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_3 (* 256 v_y_3)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_3))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_3) (<= v_z_3 255))) is different from true [2023-11-19 07:45:23,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:23,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2023-11-19 07:45:23,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-19 07:45:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-19 07:45:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-19 07:45:23,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:45:24,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835870356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:24,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:45:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-11-19 07:45:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43142685] [2023-11-19 07:45:24,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:45:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:45:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:45:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2023-11-19 07:45:24,037 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:45:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:24,303 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-11-19 07:45:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:45:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-11-19 07:45:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:24,304 INFO L225 Difference]: With dead ends: 27 [2023-11-19 07:45:24,304 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 07:45:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=305, Unknown=1, NotChecked=36, Total=420 [2023-11-19 07:45:24,306 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:24,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2023-11-19 07:45:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 07:45:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-19 07:45:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 07:45:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-11-19 07:45:24,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-11-19 07:45:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-11-19 07:45:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:45:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-11-19 07:45:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 07:45:24,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:24,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:24,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:45:24,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:24,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:24,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1779672294, now seen corresponding path program 2 times [2023-11-19 07:45:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480006711] [2023-11-19 07:45:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:25,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:45:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480006711] [2023-11-19 07:45:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480006711] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590198937] [2023-11-19 07:45:26,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:45:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:26,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:26,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:45:26,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:45:26,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:45:26,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-19 07:45:26,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:26,823 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:26,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:45:27,061 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_6 Int) (v_z_6 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_6) (<= v_z_6 255))) is different from true [2023-11-19 07:45:27,178 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_z_5 Int) (v_y_6 Int) (v_y_5 Int) (v_ArrVal_172 (Array Int Int)) (v_z_6 Int)) (and (<= 0 v_z_5) (<= 0 v_z_6) (<= v_z_6 255) (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_172))) (let ((.cse2 (store (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_5 (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_5) v_z_5))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_5 255))) is different from true [2023-11-19 07:45:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:27,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:27,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:27,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2023-11-19 07:45:27,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 3 [2023-11-19 07:45:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:45:27,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-19 07:45:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-11-19 07:45:27,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:45:28,086 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|ULTIMATE.start_main_~#v~0#1.offset| Int) (v_y_8 Int) (v_z_9 Int) (v_y_9 Int) (v_z_8 Int)) (or (< v_z_9 0) (< v_z_8 0) (< 255 v_z_8) (< 255 v_z_9) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| v_ArrVal_191))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| (+ v_z_9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset| (+ (* 256 v_y_9) v_z_9))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1 (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#s~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset| (+ v_z_8 (* 256 v_y_8))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| .cse1) |c_ULTIMATE.start_main_~#s~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#s~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_~#v~0#1.base| .cse1) |c_ULTIMATE.start_main_~#s~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) v_z_8))))))) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_192))) (< (mod (select (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) 256) (+ (mod (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4294967296) 1))))) is different from false [2023-11-19 07:45:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590198937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:28,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:45:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2023-11-19 07:45:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250588827] [2023-11-19 07:45:28,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:45:28,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 07:45:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:45:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=292, Unknown=4, NotChecked=108, Total=462 [2023-11-19 07:45:28,094 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 17 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:45:30,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:45:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:33,250 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-11-19 07:45:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:45:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 17 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-11-19 07:45:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:33,257 INFO L225 Difference]: With dead ends: 31 [2023-11-19 07:45:33,257 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 07:45:33,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=106, Invalid=545, Unknown=11, NotChecked=150, Total=812 [2023-11-19 07:45:33,259 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:33,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 5 Unknown, 54 Unchecked, 2.5s Time] [2023-11-19 07:45:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 07:45:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-19 07:45:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:45:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-11-19 07:45:33,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2023-11-19 07:45:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:33,270 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-19 07:45:33,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 17 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:45:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-11-19 07:45:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:45:33,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:33,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:33,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:45:33,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:33,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:33,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 664737784, now seen corresponding path program 2 times [2023-11-19 07:45:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791491588] [2023-11-19 07:45:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:45:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791491588] [2023-11-19 07:45:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791491588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849383633] [2023-11-19 07:45:35,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:45:35,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:35,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:35,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:35,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:45:35,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:45:35,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:45:35,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-19 07:45:35,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:35,312 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:35,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:45:35,595 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_260 (Array Int Int)) (v_z_11 Int)) (and (<= 0 v_z_11) (<= v_z_11 255) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_260))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|))) is different from true [2023-11-19 07:45:35,770 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|)) (.cse6 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (let ((.cse1 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse7 (exists ((func_to_recursive_line_12_to_15_0_~v.offset Int) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_z_10 Int) (v_y_10 Int) (v_z_11 Int)) (and (<= 0 v_z_10) (<= 0 v_z_11) (<= v_z_11 255) (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse8 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse9 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse5 func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_10 (* v_y_10 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_10)))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_2) |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_260) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse6)) (<= v_z_10 255)))) (.cse0 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (or (and (not .cse0) (not .cse1) (exists ((func_to_recursive_line_12_to_15_0_~v.offset Int) (v_DerPreprocessor_2 (Array Int Int)) (v_z_10 Int) (v_y_10 Int) (v_z_11 Int)) (and (<= 0 v_z_10) (<= 0 v_z_11) (<= v_z_11 255) (= (store (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse3 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse4 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse5 func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_10 (* v_y_10 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_10)))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_2) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse6) |c_#memory_int|) (<= v_z_10 255)))) (and .cse1 .cse7) (and .cse7 .cse0)))) is different from true [2023-11-19 07:45:35,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:35,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:35,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-11-19 07:45:35,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 70 [2023-11-19 07:45:35,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 3 [2023-11-19 07:45:36,010 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 22 treesize of output 10 [2023-11-19 07:45:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-11-19 07:45:36,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:45:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849383633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:36,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:45:36,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2023-11-19 07:45:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013651717] [2023-11-19 07:45:36,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:45:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 07:45:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:45:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2023-11-19 07:45:36,804 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 19 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:45:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:37,787 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-11-19 07:45:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:45:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2023-11-19 07:45:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:37,789 INFO L225 Difference]: With dead ends: 29 [2023-11-19 07:45:37,789 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 07:45:37,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=405, Unknown=11, NotChecked=86, Total=600 [2023-11-19 07:45:37,790 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:37,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2023-11-19 07:45:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 07:45:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 07:45:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:45:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-11-19 07:45:37,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2023-11-19 07:45:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:37,800 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-11-19 07:45:37,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:45:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-11-19 07:45:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:45:37,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:37,802 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:37,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 07:45:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:45:38,019 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:38,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2112546483, now seen corresponding path program 3 times [2023-11-19 07:45:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659679164] [2023-11-19 07:45:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:45:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659679164] [2023-11-19 07:45:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659679164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725548654] [2023-11-19 07:45:41,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:45:41,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:41,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:41,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:41,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:45:41,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 07:45:41,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:45:41,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-19 07:45:41,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:41,637 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:41,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:45:42,159 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_17 Int) (v_z_17 Int)) (and (<= 0 v_z_17) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_17 255))) is different from true [2023-11-19 07:45:42,279 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_16 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_y_17 Int) (v_z_17 Int) (v_ArrVal_376 (Array Int Int))) (and (<= 0 v_z_17) (<= v_z_17 255) (<= v_z_16 255) (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_376))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_16 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_4) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_4) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_16))) is different from true [2023-11-19 07:45:42,425 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_16 Int) (v_y_15 Int) (v_z_15 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_y_17 Int) (v_z_17 Int) (v_ArrVal_376 (Array Int Int))) (and (<= 0 v_z_17) (<= v_z_17 255) (<= v_z_16 255) (<= 0 v_z_15) (= (store (let ((.cse2 (let ((.cse3 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse4 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_15 256) v_z_15))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_5) |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_376) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_16 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_376) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_4) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_4) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_16) (<= v_z_15 255))) is different from true [2023-11-19 07:45:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:42,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2023-11-19 07:45:42,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:45:42,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 92 [2023-11-19 07:45:42,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 3 [2023-11-19 07:45:42,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-19 07:45:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2023-11-19 07:45:42,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:45:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725548654] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:44,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:45:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-11-19 07:45:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063822593] [2023-11-19 07:45:44,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:45:44,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 07:45:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 07:45:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=430, Unknown=7, NotChecked=132, Total=650 [2023-11-19 07:45:44,788 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:45:46,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:45:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:50,072 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-11-19 07:45:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:45:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 26 [2023-11-19 07:45:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:50,074 INFO L225 Difference]: With dead ends: 33 [2023-11-19 07:45:50,074 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 07:45:50,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=123, Invalid=685, Unknown=16, NotChecked=168, Total=992 [2023-11-19 07:45:50,076 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:50,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 5 Unknown, 88 Unchecked, 2.5s Time] [2023-11-19 07:45:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 07:45:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-11-19 07:45:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-19 07:45:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-11-19 07:45:50,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2023-11-19 07:45:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:50,085 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-19 07:45:50,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:45:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-11-19 07:45:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 07:45:50,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:50,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:50,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-19 07:45:50,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 07:45:50,305 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:50,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1064435583, now seen corresponding path program 3 times [2023-11-19 07:45:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359498689] [2023-11-19 07:45:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:45:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:45:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:45:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359498689] [2023-11-19 07:45:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359498689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:45:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394394378] [2023-11-19 07:45:52,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:45:52,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:45:52,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:52,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:45:52,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b481fb3d-2dc2-4655-98b9-f595c64ce849/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:45:52,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 07:45:52,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:45:52,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-19 07:45:52,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:45:52,887 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:45:52,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-19 07:45:53,659 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_26 Int) (v_y_26 Int)) (and (<= v_z_26 255) (<= 0 v_z_26) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_26 (* v_y_26 256)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_26 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|))) is different from true [2023-11-19 07:45:54,013 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|)) (.cse6 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse11 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse0 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (or (and .cse0 (exists ((v_z_25 Int) (v_y_25 Int) (v_z_26 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_y_26 Int)) (and (<= 0 v_z_25) (<= v_z_26 255) (<= 0 v_z_26) (= (store (let ((.cse3 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse4 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_25 (* v_y_25 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_25)))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_10))) (let ((.cse1 (store (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_26 (* v_y_26 256))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse1) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse2 (select (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse1) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse2 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_26 (select .cse2 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse6) |c_#memory_int|) (<= v_z_25 255)))) (and (exists ((v_z_25 Int) (v_y_25 Int) (v_z_26 Int) (v_y_26 Int) (v_DerPreprocessor_7 (Array Int Int))) (and (= |c_#memory_int| (store (let ((.cse9 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse10 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_25 (* v_y_25 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse10 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse10 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_25)))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_7))) (let ((.cse7 (store (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_26 (* v_y_26 256))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse8 (select (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_26 (select .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse6)) (<= 0 v_z_25) (<= v_z_26 255) (<= 0 v_z_26) (<= v_z_25 255))) .cse11) (and (exists ((v_z_25 Int) (v_y_25 Int) (v_z_26 Int) (v_y_26 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (store (let ((.cse14 (let ((.cse15 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_25 (* v_y_25 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse15 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse15 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_25))))) (let ((.cse12 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_DerPreprocessor_8) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse14) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_9) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_26 (* v_y_26 256))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse13 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse14) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_9) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_26 (select .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse6) |c_#memory_int|) (<= 0 v_z_25) (<= v_z_26 255) (<= 0 v_z_26) (<= v_z_25 255))) (not .cse11) (not .cse0)))) is different from true [2023-11-19 07:45:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:58,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:58,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2023-11-19 07:45:58,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:45:58,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:45:59,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:59,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:45:59,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2023-11-19 07:45:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-11-19 07:45:59,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2023-11-19 07:45:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2023-11-19 07:45:59,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:46:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394394378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:46:02,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:46:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2023-11-19 07:46:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391045695] [2023-11-19 07:46:02,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:46:02,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 07:46:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:02,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 07:46:02,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=521, Unknown=16, NotChecked=98, Total=756 [2023-11-19 07:46:02,020 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 25 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)