./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:51:45,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:51:45,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:51:45,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:51:45,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:51:45,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:51:45,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:51:45,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:51:45,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:51:45,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:51:45,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:51:45,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:51:45,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:51:45,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:51:45,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:51:45,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:51:45,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:51:45,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:51:45,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:51:45,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:51:45,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:51:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:51:45,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:51:45,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:51:45,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:51:45,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:51:45,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:51:45,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:51:45,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:51:45,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:51:45,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:51:45,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:51:45,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:51:45,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:51:45,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:51:45,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:51:45,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:51:45,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:51:45,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:51:45,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:51:45,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:51:45,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:51:45,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:51:45,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:51:45,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:51:45,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:51:45,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:51:45,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:51:45,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:51:45,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:51:45,493 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:51:45,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:51:45,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:51:45,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:51:45,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:51:45,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:51:45,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:51:45,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:51:45,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:51:45,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:51:45,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:51:45,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:51:45,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:51:45,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:51:45,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:51:45,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:51:45,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:51:45,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:51:45,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:51:45,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:51:45,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:51:45,498 INFO L138 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_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/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_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2022-11-25 17:51:45,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:51:45,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:51:45,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:51:45,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:51:45,775 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:51:45,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/sina3.c [2022-11-25 17:51:48,909 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:51:49,139 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:51:49,140 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/sv-benchmarks/c/array-fpi/sina3.c [2022-11-25 17:51:49,147 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/data/9650d7b28/c64041a8bdce4d85828f8cb8631c3b4f/FLAGec04d16f9 [2022-11-25 17:51:49,164 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/data/9650d7b28/c64041a8bdce4d85828f8cb8631c3b4f [2022-11-25 17:51:49,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:51:49,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:51:49,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:51:49,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:51:49,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:51:49,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f68d410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49, skipping insertion in model container [2022-11-25 17:51:49,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:51:49,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:51:49,350 WARN L237 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_d9afb17b-fd80-4469-ab0e-ac011c197a4a/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-25 17:51:49,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:51:49,382 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:51:49,395 WARN L237 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_d9afb17b-fd80-4469-ab0e-ac011c197a4a/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-25 17:51:49,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:51:49,417 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:51:49,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49 WrapperNode [2022-11-25 17:51:49,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:51:49,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:51:49,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:51:49,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:51:49,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,456 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-25 17:51:49,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:51:49,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:51:49,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:51:49,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:51:49,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:51:49,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:51:49,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:51:49,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:51:49,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (1/1) ... [2022-11-25 17:51:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:51:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:51:49,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:51:49,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:51:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:51:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:51:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:51:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:51:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:51:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:51:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:51:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:51:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:51:49,678 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:51:49,681 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:51:49,856 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:51:49,863 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:51:49,863 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 17:51:49,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:51:49 BoogieIcfgContainer [2022-11-25 17:51:49,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:51:49,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:51:49,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:51:49,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:51:49,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:51:49" (1/3) ... [2022-11-25 17:51:49,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a26ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:51:49, skipping insertion in model container [2022-11-25 17:51:49,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:51:49" (2/3) ... [2022-11-25 17:51:49,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a26ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:51:49, skipping insertion in model container [2022-11-25 17:51:49,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:51:49" (3/3) ... [2022-11-25 17:51:49,875 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-11-25 17:51:49,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:51:49,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:51:49,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:51:50,000 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=LoopsAndPotentialCycles, 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;@7b8058de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:51:50,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:51:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:51:50,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:50,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:50,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-25 17:51:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:51:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909361773] [2022-11-25 17:51:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:51:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:51:50,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:51:50,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909361773] [2022-11-25 17:51:50,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909361773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:51:50,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:51:50,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:51:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069438820] [2022-11-25 17:51:50,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:51:50,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:51:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:51:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:51:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:51:50,401 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:51:50,427 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-25 17:51:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:51:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:51:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:51:50,438 INFO L225 Difference]: With dead ends: 50 [2022-11-25 17:51:50,438 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 17:51:50,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:51:50,449 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:51:50,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:51:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 17:51:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 17:51:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-25 17:51:50,495 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-25 17:51:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:51:50,496 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-25 17:51:50,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-25 17:51:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:51:50,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:50,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:51:50,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-25 17:51:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:51:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10357237] [2022-11-25 17:51:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:51:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:51:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:51:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10357237] [2022-11-25 17:51:50,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10357237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:51:50,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:51:50,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:51:50,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260303161] [2022-11-25 17:51:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:51:50,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:51:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:51:50,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:51:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:51:50,792 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:51:50,904 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-25 17:51:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:51:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:51:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:51:50,906 INFO L225 Difference]: With dead ends: 53 [2022-11-25 17:51:50,906 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 17:51:50,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:51:50,908 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:51:50,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:51:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 17:51:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-25 17:51:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 17:51:50,916 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-25 17:51:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:51:50,916 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 17:51:50,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 17:51:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:51:50,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:50,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:50,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:51:50,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-25 17:51:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:51:50,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616448499] [2022-11-25 17:51:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:51:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:51:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:51:53,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616448499] [2022-11-25 17:51:53,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616448499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:51:53,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371854741] [2022-11-25 17:51:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:53,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:51:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:51:53,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:51:53,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:51:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:53,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 17:51:53,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:51:53,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:51:53,576 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:51:53,581 INFO L350 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 28 treesize of output 24 [2022-11-25 17:51:53,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:51:53,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:51:54,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:51:54,038 INFO L350 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 26 treesize of output 28 [2022-11-25 17:51:54,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:51:54,283 INFO L350 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 43 treesize of output 33 [2022-11-25 17:51:54,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:51:54,553 INFO L350 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 47 treesize of output 33 [2022-11-25 17:51:54,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:51:54,873 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:51:54,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2022-11-25 17:51:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:51:54,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:51:55,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:51:55,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:51:55,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:51:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:51:55,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371854741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:51:55,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:51:55,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-11-25 17:51:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767405987] [2022-11-25 17:51:55,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:51:55,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 17:51:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:51:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 17:51:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 17:51:55,581 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:51:57,886 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-11-25 17:51:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 17:51:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:51:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:51:57,888 INFO L225 Difference]: With dead ends: 79 [2022-11-25 17:51:57,888 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 17:51:57,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=504, Invalid=2802, Unknown=0, NotChecked=0, Total=3306 [2022-11-25 17:51:57,890 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 162 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:51:57,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 158 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:51:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 17:51:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2022-11-25 17:51:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-25 17:51:57,903 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2022-11-25 17:51:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:51:57,903 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-25 17:51:57,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-25 17:51:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:51:57,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:57,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:57,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:51:58,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:51:58,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 924425184, now seen corresponding path program 2 times [2022-11-25 17:51:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:51:58,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463579850] [2022-11-25 17:51:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:51:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:51:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:51:58,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463579850] [2022-11-25 17:51:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463579850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:51:58,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010599622] [2022-11-25 17:51:58,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:51:58,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:51:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:51:58,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:51:58,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:51:58,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:51:58,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:51:58,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:51:58,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:51:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:51:58,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:51:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:51:58,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010599622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:51:58,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:51:58,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-25 17:51:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15725533] [2022-11-25 17:51:58,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:51:58,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:51:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:51:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:51:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:51:58,433 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:51:58,763 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-11-25 17:51:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:51:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 17:51:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:51:58,765 INFO L225 Difference]: With dead ends: 99 [2022-11-25 17:51:58,765 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 17:51:58,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:51:58,766 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:51:58,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 95 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:51:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 17:51:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-11-25 17:51:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-25 17:51:58,773 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-11-25 17:51:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:51:58,773 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-25 17:51:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:51:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-25 17:51:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:51:58,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:58,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:58,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:51:58,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:51:58,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 3 times [2022-11-25 17:51:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:51:58,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463629300] [2022-11-25 17:51:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:51:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:52:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:52:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:52:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463629300] [2022-11-25 17:52:01,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463629300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:52:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997214698] [2022-11-25 17:52:01,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:52:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:52:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:52:01,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:52:01,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:52:01,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 17:52:01,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:52:01,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 17:52:01,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:52:01,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:52:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:01,696 INFO L350 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 18 treesize of output 16 [2022-11-25 17:52:01,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:01,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:52:01,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:01,998 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 17:52:01,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 17:52:02,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:02,517 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 17:52:02,518 INFO L350 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 1 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 17:52:02,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:02,733 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-25 17:52:02,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 62 [2022-11-25 17:52:03,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:52:03,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,416 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:52:03,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2022-11-25 17:52:03,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:03,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:52:03,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2022-11-25 17:52:04,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2022-11-25 17:52:04,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:04,436 INFO L321 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2022-11-25 17:52:04,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 74 [2022-11-25 17:52:05,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:05,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:52:05,137 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:52:05,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-25 17:52:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:52:05,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:53:57,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:53:57,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:53:57,282 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-25 17:53:57,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 1 [2022-11-25 17:53:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:53:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997214698] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:53:57,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:53:57,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 24] total 67 [2022-11-25 17:53:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834691706] [2022-11-25 17:53:57,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:53:57,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-25 17:53:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-25 17:53:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=3881, Unknown=51, NotChecked=0, Total=4422 [2022-11-25 17:53:57,289 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:59,823 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse31 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (+ c_~N~0 1))) (and (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= (select (store (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))))) (store (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse11 .cse12 .cse13))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (<= (mod c_~N~0 4294967296) 536870911) (or (< .cse9 c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= .cse8 (select (store (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 (select (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse20))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))))) (store (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 (select (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse27))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse32 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))))) (store (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse33 .cse34 .cse35))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse16 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (store (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse39 .cse40 (select (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse41))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47))))) (store (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse45 (select (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse46 .cse47)))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))))) is different from true [2022-11-25 17:54:23,320 WARN L233 SmtUtils]: Spent 18.29s on a formula simplification. DAG size of input: 98 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:54:56,898 WARN L233 SmtUtils]: Spent 33.03s on a formula simplification. DAG size of input: 128 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:54:58,988 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 [1] [2022-11-25 17:55:01,019 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 [1] [2022-11-25 17:55:03,059 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 [1] [2022-11-25 17:55:07,008 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 [1] [2022-11-25 17:55:09,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:55:11,042 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 [1] [2022-11-25 17:55:14,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:55:16,623 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 [1] [2022-11-25 17:55:18,637 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 [1] [2022-11-25 17:55:20,651 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 [1] [2022-11-25 17:55:59,827 WARN L233 SmtUtils]: Spent 32.99s on a formula simplification. DAG size of input: 131 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:56:31,460 WARN L233 SmtUtils]: Spent 28.75s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:56:34,101 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 [1] [2022-11-25 17:56:36,120 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 [1] [2022-11-25 17:56:57,195 WARN L233 SmtUtils]: Spent 17.68s on a formula simplification. DAG size of input: 101 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:56:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:56:59,149 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-25 17:56:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 17:56:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 17:56:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:56:59,152 INFO L225 Difference]: With dead ends: 100 [2022-11-25 17:56:59,152 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 17:56:59,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3131 ImplicationChecksByTransitivity, 267.9s TimeCoverageRelationStatistics Valid=1216, Invalid=9035, Unknown=55, NotChecked=200, Total=10506 [2022-11-25 17:56:59,158 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 271 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 161 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:56:59,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 310 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 853 Invalid, 11 Unknown, 11 Unchecked, 27.8s Time] [2022-11-25 17:56:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 17:56:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2022-11-25 17:56:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-25 17:56:59,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 32 [2022-11-25 17:56:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:56:59,180 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-25 17:56:59,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-25 17:56:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 17:56:59,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:56:59,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:59,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:56:59,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:56:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 4 times [2022-11-25 17:56:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703233720] [2022-11-25 17:56:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:56:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703233720] [2022-11-25 17:56:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703233720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:56:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723622753] [2022-11-25 17:56:59,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:56:59,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:56:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:56:59,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:56:59,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:56:59,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:56:59,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:56:59,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:56:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:56:59,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:56:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:56:59,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723622753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:56:59,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:56:59,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 17:56:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397456822] [2022-11-25 17:56:59,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:56:59,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:56:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:56:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:56:59,859 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:57:00,313 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-11-25 17:57:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:57:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 17:57:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:57:00,314 INFO L225 Difference]: With dead ends: 118 [2022-11-25 17:57:00,314 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 17:57:00,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:57:00,316 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 106 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:57:00,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 125 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:57:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 17:57:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 64. [2022-11-25 17:57:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-25 17:57:00,340 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 34 [2022-11-25 17:57:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:57:00,340 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-25 17:57:00,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-25 17:57:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:57:00,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:57:00,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:00,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:57:00,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:00,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:57:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-25 17:57:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:00,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629438381] [2022-11-25 17:57:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:57:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:57:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629438381] [2022-11-25 17:57:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629438381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:57:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341202295] [2022-11-25 17:57:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:02,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:57:03,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:57:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:03,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-25 17:57:03,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:57:03,235 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:57:03,236 INFO L350 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 [2022-11-25 17:57:03,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:57:03,340 INFO L350 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 23 treesize of output 22 [2022-11-25 17:57:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:57:03,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 17:57:04,048 INFO L350 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 30 treesize of output 33 [2022-11-25 17:57:04,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:57:04,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 17:57:04,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:57:04,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:57:04,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:57:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:57:04,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-25 17:57:05,251 INFO L350 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 39 treesize of output 40 [2022-11-25 17:57:05,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:57:05,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2022-11-25 17:57:05,502 INFO L350 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 [2022-11-25 17:57:06,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 34 [2022-11-25 17:57:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:57:06,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:57:06,589 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (store v_ArrVal_319 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:06,730 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:06,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:06,760 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:07,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:07,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-25 17:57:07,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:57:07,072 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 169 [2022-11-25 17:57:07,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_319 (Array Int Int))) (or (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_2))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))) is different from false [2022-11-25 17:57:07,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_319 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (= (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_2))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_319))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_2 .cse1) 1))))) is different from false [2022-11-25 17:57:11,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:57:11,423 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 17:57:11,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 583 treesize of output 1 [2022-11-25 17:57:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-25 17:57:11,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341202295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:57:11,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:57:11,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 66 [2022-11-25 17:57:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096011776] [2022-11-25 17:57:11,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:57:11,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-25 17:57:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:57:11,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-25 17:57:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2969, Unknown=37, NotChecked=952, Total=4290 [2022-11-25 17:57:11,432 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:21,938 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:57:39,583 WARN L233 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 81 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:58:05,208 WARN L233 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 138 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:58:32,327 WARN L233 SmtUtils]: Spent 23.49s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:58:48,404 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 119 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:58:58,687 WARN L233 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:59:49,529 WARN L233 SmtUtils]: Spent 37.51s on a formula simplification. DAG size of input: 145 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:00:18,312 WARN L233 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:00:49,600 WARN L233 SmtUtils]: Spent 18.86s on a formula simplification. DAG size of input: 183 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:01:01,963 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 151 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:01:09,749 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 196 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:01:49,405 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 147 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:02:05,125 WARN L233 SmtUtils]: Spent 13.09s on a formula simplification. DAG size of input: 175 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:02:14,840 WARN L233 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 143 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:02:55,885 WARN L233 SmtUtils]: Spent 36.76s on a formula simplification. DAG size of input: 168 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:03:32,862 WARN L233 SmtUtils]: Spent 27.44s on a formula simplification. DAG size of input: 171 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:04:01,953 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 111 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:04:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:16,552 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2022-11-25 18:04:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-25 18:04:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 18:04:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:16,555 INFO L225 Difference]: With dead ends: 226 [2022-11-25 18:04:16,555 INFO L226 Difference]: Without dead ends: 224 [2022-11-25 18:04:16,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 11271 ImplicationChecksByTransitivity, 414.2s TimeCoverageRelationStatistics Valid=3293, Invalid=29212, Unknown=107, NotChecked=2920, Total=35532 [2022-11-25 18:04:16,567 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 969 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 254 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 936 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:16,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 854 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1675 Invalid, 73 Unknown, 936 Unchecked, 18.1s Time] [2022-11-25 18:04:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-25 18:04:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 75. [2022-11-25 18:04:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.135135135135135) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-25 18:04:16,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 36 [2022-11-25 18:04:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:16,609 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-25 18:04:16,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-25 18:04:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:04:16,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:16,611 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:16,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:04:16,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:16,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:04:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 475985222, now seen corresponding path program 2 times [2022-11-25 18:04:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211917975] [2022-11-25 18:04:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:04:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211917975] [2022-11-25 18:04:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211917975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588837977] [2022-11-25 18:04:17,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:04:17,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:17,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:17,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:04:17,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:04:17,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:04:17,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:04:17,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:04:18,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:04:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588837977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:04:19,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:04:19,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 18:04:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818270983] [2022-11-25 18:04:19,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:04:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:04:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:04:19,439 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:21,287 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-25 18:04:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:04:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 18:04:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:21,289 INFO L225 Difference]: With dead ends: 113 [2022-11-25 18:04:21,289 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:04:21,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:04:21,291 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:21,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 82 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:04:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:04:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2022-11-25 18:04:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-25 18:04:21,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2022-11-25 18:04:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:21,310 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-25 18:04:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-25 18:04:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:04:21,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:21,312 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:21,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:04:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 18:04:21,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:04:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 5 times [2022-11-25 18:04:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:21,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405271191] [2022-11-25 18:04:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405271191] [2022-11-25 18:04:36,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405271191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535799610] [2022-11-25 18:04:36,356 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:04:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:36,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:36,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9afb17b-fd80-4469-ab0e-ac011c197a4a/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:04:36,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 18:04:36,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:04:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 18:04:36,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:37,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:04:37,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:37,473 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:04:37,473 INFO L350 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 28 treesize of output 24 [2022-11-25 18:04:38,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:04:39,358 INFO L350 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 35 treesize of output 37 [2022-11-25 18:04:40,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:40,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:40,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 18:04:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:42,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:42,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:42,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-25 18:04:43,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:43,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:43,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:43,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:43,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-25 18:04:44,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:44,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:44,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:44,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-25 18:04:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:46,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:46,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:46,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-25 18:04:48,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:48,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:48,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:48,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:48,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-25 18:04:50,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:50,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:50,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:50,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-25 18:04:52,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:52,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:52,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:52,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:52,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-11-25 18:04:54,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:54,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:54,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:54,141 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:04:54,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 68 [2022-11-25 18:04:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:55,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:55,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:55,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:55,686 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:04:55,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:04:58,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:58,773 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:04:58,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-25 18:04:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:59,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:59,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:59,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:59,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:59,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:59,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:05:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535799610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:05:59,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:05:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 30] total 87 [2022-11-25 18:05:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368572757] [2022-11-25 18:05:59,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-25 18:05:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-25 18:05:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=6819, Unknown=6, NotChecked=0, Total=7482 [2022-11-25 18:05:59,215 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 87 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,627 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse51 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse49 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse48 (store .cse51 (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse50 (+ .cse49 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse51 .cse50 1)) (.cse9 (store .cse48 .cse50 1)) (.cse20 (+ .cse49 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ c_~N~0 1)) (.cse11 (< 3 c_~N~0))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse2 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9))) (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4 .cse5)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse13 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse19 .cse20 1)))) (store .cse18 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse15 .cse16 .cse17)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (<= (mod c_~N~0 4294967296) 536870911) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461)))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse23 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse21 .cse22 .cse23 .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse30 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19))) (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse32))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse32)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse35 (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse9 .cse20 1)))) (store .cse40 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse37 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse37 .cse38 .cse39)))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_461 Int) (v_ArrVal_459 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_143| 1) |v_ULTIMATE.start_main_~i~0#1_142|)) (= (let ((.cse45 (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_143| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_459) (+ (* |v_ULTIMATE.start_main_~i~0#1_142| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_461))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse41 .cse42 .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse10) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_143|)) (not (< |v_ULTIMATE.start_main_~i~0#1_142| c_~N~0)))) .cse11))))) is different from true [2022-11-25 18:06:27,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]