./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s2lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8 --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- 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-e04fb08 [2022-11-16 11:54:55,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:54:55,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:54:55,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:54:55,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:54:55,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:54:55,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:54:55,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:54:55,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:54:55,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:54:55,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:54:55,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:54:55,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:54:55,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:54:55,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:54:55,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:54:55,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:54:55,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:54:55,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:54:55,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:54:55,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:54:55,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:54:55,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:54:55,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:54:55,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:54:55,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:54:55,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:54:55,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:54:55,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:54:55,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:54:55,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:54:55,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:54:55,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:54:55,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:54:55,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:54:55,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:54:55,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:54:55,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:54:55,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:54:55,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:54:55,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:54:55,491 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:54:55,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:54:55,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:54:55,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:54:55,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:54:55,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:54:55,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:54:55,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:54:55,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:54:55,543 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:54:55,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:54:55,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:54:55,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:54:55,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:54:55,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:54:55,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:54:55,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:54:55,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:54:55,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:54:55,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:54:55,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:54:55,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:54:55,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:54:55,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:54:55,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:54:55,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:55,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:54:55,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:54:55,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:54:55,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:54:55,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:54:55,553 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:54:55,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:54:55,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:54:55,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-11-16 11:54:55,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:54:55,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:54:55,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:54:55,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:54:55,944 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:54:55,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-11-16 11:54:56,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/6d8c91b28/bfa50650f1484ea0bb1f7f0b57fb93cd/FLAG43c6544f0 [2022-11-16 11:54:56,592 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:54:56,593 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c [2022-11-16 11:54:56,602 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/6d8c91b28/bfa50650f1484ea0bb1f7f0b57fb93cd/FLAG43c6544f0 [2022-11-16 11:54:56,977 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/6d8c91b28/bfa50650f1484ea0bb1f7f0b57fb93cd [2022-11-16 11:54:56,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:54:56,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:54:56,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:56,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:54:56,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:54:56,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:56" (1/1) ... [2022-11-16 11:54:56,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbff9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:56, skipping insertion in model container [2022-11-16 11:54:56,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:56" (1/1) ... [2022-11-16 11:54:57,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:54:57,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:54:57,318 WARN L229 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-16 11:54:57,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:57,385 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:54:57,409 WARN L229 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-16 11:54:57,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:57,459 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:54:57,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57 WrapperNode [2022-11-16 11:54:57,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:57,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:57,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:54:57,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:54:57,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,533 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-16 11:54:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:57,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:54:57,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:54:57,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:54:57,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,591 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:54:57,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:54:57,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:54:57,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:54:57,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (1/1) ... [2022-11-16 11:54:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:57,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:57,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:54:57,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:54:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:54:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:54:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:54:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:54:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:54:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:54:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:54:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:54:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:54:57,779 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:54:57,781 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:54:57,990 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:54:57,997 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:54:57,998 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:54:58,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:58 BoogieIcfgContainer [2022-11-16 11:54:58,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:54:58,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:54:58,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:54:58,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:54:58,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:54:56" (1/3) ... [2022-11-16 11:54:58,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1855a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:58, skipping insertion in model container [2022-11-16 11:54:58,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:57" (2/3) ... [2022-11-16 11:54:58,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1855a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:58, skipping insertion in model container [2022-11-16 11:54:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:58" (3/3) ... [2022-11-16 11:54:58,027 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-11-16 11:54:58,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:54:58,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:54:58,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:54:58,130 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;@74301e5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:54:58,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:54:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-16 11:54:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:54:58,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:58,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:58,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:54:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-16 11:54:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:58,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340460887] [2022-11-16 11:54:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:58,386 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-16 11:54:58,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:58,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340460887] [2022-11-16 11:54:58,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340460887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:58,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:58,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:54:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512795165] [2022-11-16 11:54:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:58,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:54:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:54:58,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:54:58,440 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 11:54:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:58,464 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-16 11:54:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:54:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-16 11:54:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:58,478 INFO L225 Difference]: With dead ends: 40 [2022-11-16 11:54:58,479 INFO L226 Difference]: Without dead ends: 18 [2022-11-16 11:54:58,483 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-16 11:54:58,491 INFO L413 NwaCegarLoop]: 26 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, 26 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-16 11:54:58,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:54:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-16 11:54:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-16 11:54:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-16 11:54:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-16 11:54:58,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-16 11:54:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:58,551 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-16 11:54:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 11:54:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-16 11:54:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:54:58,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:58,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:54:58,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:54:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-16 11:54:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:58,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863779534] [2022-11-16 11:54:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:58,820 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-16 11:54:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:58,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863779534] [2022-11-16 11:54:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863779534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:58,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:58,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987725786] [2022-11-16 11:54:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:58,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:58,825 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 11:54:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:58,916 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-16 11:54:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:54:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-16 11:54:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:58,918 INFO L225 Difference]: With dead ends: 36 [2022-11-16 11:54:58,918 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 11:54:58,919 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-16 11:54:58,920 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:58,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 11:54:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-16 11:54:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-16 11:54:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-16 11:54:58,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-16 11:54:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:58,929 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-16 11:54:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 11:54:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-16 11:54:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:58,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:58,930 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] [2022-11-16 11:54:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:54:58,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:54:58,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-16 11:54:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:58,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680357856] [2022-11-16 11:54:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:00,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680357856] [2022-11-16 11:55:00,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680357856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871939066] [2022-11-16 11:55:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:00,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:01,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:01,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:55:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:01,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-16 11:55:01,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:01,214 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 10 treesize of output 8 [2022-11-16 11:55:01,233 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-16 11:55:01,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:55:01,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 23 [2022-11-16 11:55:01,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 23 [2022-11-16 11:55:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:01,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:02,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:55:02,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-11-16 11:55:02,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:55:02,499 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-16 11:55:02,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:55:02,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-16 11:55:02,513 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 14 treesize of output 10 [2022-11-16 11:55:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:02,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871939066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:02,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:02,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-11-16 11:55:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227241179] [2022-11-16 11:55:02,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:02,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:55:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:55:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-11-16 11:55:02,533 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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-16 11:55:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:02,965 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-16 11:55:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:55:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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 20 [2022-11-16 11:55:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:02,969 INFO L225 Difference]: With dead ends: 46 [2022-11-16 11:55:02,969 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 11:55:02,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:55:02,973 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:02,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 57 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-11-16 11:55:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 11:55:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-11-16 11:55:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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-16 11:55:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-11-16 11:55:03,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-11-16 11:55:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:03,003 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-11-16 11:55:03,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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-16 11:55:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-11-16 11:55:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:55:03,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:03,006 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] [2022-11-16 11:55:03,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:03,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:03,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:55:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-16 11:55:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:03,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834021379] [2022-11-16 11:55:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834021379] [2022-11-16 11:55:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834021379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566761103] [2022-11-16 11:55:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:03,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:03,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:03,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:03,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:55:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:55:03,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:03,704 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 18 treesize of output 14 [2022-11-16 11:55:03,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:55:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:03,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:03,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-16 11:55:03,812 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-16 11:55:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:03,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566761103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:03,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:03,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-16 11:55:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882275222] [2022-11-16 11:55:03,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:03,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:55:03,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:55:03,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:55:03,836 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-16 11:55:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:03,970 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-16 11:55:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:55:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2022-11-16 11:55:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:03,972 INFO L225 Difference]: With dead ends: 49 [2022-11-16 11:55:03,972 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 11:55:03,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:55:03,974 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:03,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 11:55:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-16 11:55:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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-16 11:55:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-11-16 11:55:03,984 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-11-16 11:55:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:03,985 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-11-16 11:55:03,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-16 11:55:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-11-16 11:55:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:55:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:03,987 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] [2022-11-16 11:55:03,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:04,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:04,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:55:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-16 11:55:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:04,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744168484] [2022-11-16 11:55:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:04,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744168484] [2022-11-16 11:55:04,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744168484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:04,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805072334] [2022-11-16 11:55:04,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:55:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:04,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:04,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:55:04,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:55:04,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:04,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:55:04,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:04,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805072334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:04,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-16 11:55:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131980659] [2022-11-16 11:55:04,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:55:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:55:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:55:04,560 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-16 11:55:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:04,717 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-16 11:55:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:55:04,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 22 [2022-11-16 11:55:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:04,720 INFO L225 Difference]: With dead ends: 70 [2022-11-16 11:55:04,720 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 11:55:04,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:55:04,724 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:04,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 25 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 11:55:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-11-16 11:55:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-16 11:55:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-16 11:55:04,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-16 11:55:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:04,745 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-16 11:55:04,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-16 11:55:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-16 11:55:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:55:04,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:04,747 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] [2022-11-16 11:55:04,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:04,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:55:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-16 11:55:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:04,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293739120] [2022-11-16 11:55:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:05,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293739120] [2022-11-16 11:55:05,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293739120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:05,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504372415] [2022-11-16 11:55:05,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:55:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:05,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:05,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:55:05,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:55:05,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:05,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:55:05,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:05,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:55:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504372415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-16 11:55:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044040428] [2022-11-16 11:55:05,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:05,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:55:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:55:05,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:55:05,330 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-16 11:55:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:05,522 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-16 11:55:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:55:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 22 [2022-11-16 11:55:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:05,524 INFO L225 Difference]: With dead ends: 39 [2022-11-16 11:55:05,524 INFO L226 Difference]: Without dead ends: 31 [2022-11-16 11:55:05,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:55:05,525 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:05,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:55:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-16 11:55:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-16 11:55:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-16 11:55:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-16 11:55:05,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-11-16 11:55:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:05,533 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-16 11:55:05,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-16 11:55:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-16 11:55:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:55:05,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:05,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:55:05,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:05,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:55:05,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:55:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-16 11:55:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:05,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407106210] [2022-11-16 11:55:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407106210] [2022-11-16 11:55:08,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407106210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417026984] [2022-11-16 11:55:08,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:55:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:08,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:08,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:55:08,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:55:08,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:55:08,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 11:55:08,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:08,169 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 10 treesize of output 8 [2022-11-16 11:55:08,179 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-16 11:55:08,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:55:08,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:55:08,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 27 [2022-11-16 11:55:08,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:55:08,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-16 11:55:08,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:55:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:55:08,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-16 11:55:09,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-16 11:55:09,345 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 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-16 11:55:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:09,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:11,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:55:11,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-11-16 11:55:25,178 WARN L233 SmtUtils]: Spent 13.85s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:36,730 WARN L233 SmtUtils]: Spent 11.25s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:36,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417026984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:36,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:36,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-11-16 11:55:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319352993] [2022-11-16 11:55:36,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:55:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:55:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2068, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 11:55:36,878 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 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-16 11:56:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:05,825 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-11-16 11:56:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 11:56:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 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) Word has length 27 [2022-11-16 11:56:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:05,826 INFO L225 Difference]: With dead ends: 93 [2022-11-16 11:56:05,826 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 11:56:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=1246, Invalid=6410, Unknown=0, NotChecked=0, Total=7656 [2022-11-16 11:56:05,831 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 99 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:05,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 95 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 627 Invalid, 0 Unknown, 125 Unchecked, 4.2s Time] [2022-11-16 11:56:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 11:56:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-11-16 11:56:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 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-16 11:56:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-11-16 11:56:05,849 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2022-11-16 11:56:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:05,850 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-11-16 11:56:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 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-16 11:56:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-11-16 11:56:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:56:05,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:05,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:05,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 11:56:06,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:56:06,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:56:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-16 11:56:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:06,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062034677] [2022-11-16 11:56:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:56:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:56:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062034677] [2022-11-16 11:56:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062034677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951863873] [2022-11-16 11:56:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:56:06,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:56:06,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:56:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:07,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 11:56:07,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:56:07,143 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 15 treesize of output 11 [2022-11-16 11:56:07,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:07,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:56:07,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 11:56:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:56:07,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:07,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-16 11:56:07,604 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 20 treesize of output 16 [2022-11-16 11:56:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:56:07,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951863873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:56:07,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:56:07,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-16 11:56:07,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714309005] [2022-11-16 11:56:07,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:07,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:56:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:07,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:56:07,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:56:07,710 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-16 11:56:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:08,441 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-11-16 11:56:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:56:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 27 [2022-11-16 11:56:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:08,442 INFO L225 Difference]: With dead ends: 79 [2022-11-16 11:56:08,442 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 11:56:08,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:56:08,444 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:08,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 64 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:56:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 11:56:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-11-16 11:56:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 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-16 11:56:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-11-16 11:56:08,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2022-11-16 11:56:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:08,460 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-11-16 11:56:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-16 11:56:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-11-16 11:56:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:56:08,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:08,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:08,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 11:56:08,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 11:56:08,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:56:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-11-16 11:56:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:08,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161272118] [2022-11-16 11:56:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:56:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:56:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161272118] [2022-11-16 11:56:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161272118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833696321] [2022-11-16 11:56:09,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:56:09,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:56:09,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:56:09,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:56:09,141 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-16 11:56:09,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:56:09,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:56:09,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:56:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:56:09,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:56:09,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833696321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:56:09,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:56:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-16 11:56:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689453306] [2022-11-16 11:56:09,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:56:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:56:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:56:09,915 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-16 11:56:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:10,644 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-16 11:56:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:56:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 29 [2022-11-16 11:56:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:10,646 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:56:10,646 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 11:56:10,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:56:10,648 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:10,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 41 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:56:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 11:56:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-16 11:56:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-16 11:56:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-16 11:56:10,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-11-16 11:56:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:10,664 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-16 11:56:10,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-16 11:56:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-16 11:56:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:56:10,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:10,665 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:10,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:56:10,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:10,882 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:56:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-11-16 11:56:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:10,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150185843] [2022-11-16 11:56:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:56:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:56:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150185843] [2022-11-16 11:56:11,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150185843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949988940] [2022-11-16 11:56:11,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:56:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:11,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:56:11,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:56:11,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:56:11,344 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-16 11:56:11,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:56:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:56:11,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:56:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:56:11,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:56:12,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949988940] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:56:12,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:56:12,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-16 11:56:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304316225] [2022-11-16 11:56:12,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:12,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:56:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:56:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:56:12,150 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-16 11:56:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:12,832 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-16 11:56:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:56:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Word has length 29 [2022-11-16 11:56:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:12,833 INFO L225 Difference]: With dead ends: 48 [2022-11-16 11:56:12,833 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 11:56:12,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:56:12,835 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 81 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 24 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:56:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 11:56:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-16 11:56:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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-16 11:56:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-16 11:56:12,847 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-11-16 11:56:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:12,847 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-16 11:56:12,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-16 11:56:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-16 11:56:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:56:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:12,849 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:12,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:56:13,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:56:13,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:56:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-11-16 11:56:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:13,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260325456] [2022-11-16 11:56:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:56:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:56:19,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260325456] [2022-11-16 11:56:19,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260325456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:19,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448158754] [2022-11-16 11:56:19,230 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:56:19,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:19,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:56:19,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:56:19,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:56:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:19,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 11:56:19,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:56:19,372 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-16 11:56:19,387 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 10 treesize of output 8 [2022-11-16 11:56:19,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:56:19,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:56:19,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:56:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 27 [2022-11-16 11:56:20,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:20,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-16 11:56:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:21,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:21,780 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 54 treesize of output 47 [2022-11-16 11:56:22,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:56:22,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:22,518 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-16 11:56:23,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:23,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:23,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:23,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:56:23,217 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 62 treesize of output 49 [2022-11-16 11:56:23,860 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 45 [2022-11-16 11:56:24,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 63 treesize of output 35 [2022-11-16 11:56:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:56:24,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:35,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:56:35,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-11-16 11:56:37,480 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 1)))))) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-11-16 11:56:37,777 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-11-16 11:56:40,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))))) is different from false [2022-11-16 11:56:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 11:56:40,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448158754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:56:40,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:56:40,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-11-16 11:56:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818709677] [2022-11-16 11:56:40,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:40,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-16 11:56:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-16 11:56:40,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3048, Unknown=3, NotChecked=348, Total=3782 [2022-11-16 11:56:40,626 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-16 11:56:43,514 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))))) is different from false [2022-11-16 11:56:45,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-16 11:57:10,984 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 136 DAG size of output: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:57:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:10,991 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-16 11:57:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:57:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-16 11:57:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:10,992 INFO L225 Difference]: With dead ends: 73 [2022-11-16 11:57:10,993 INFO L226 Difference]: Without dead ends: 69 [2022-11-16 11:57:10,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=561, Invalid=4010, Unknown=5, NotChecked=680, Total=5256 [2022-11-16 11:57:10,996 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:10,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 125 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 918 Invalid, 0 Unknown, 193 Unchecked, 6.3s Time] [2022-11-16 11:57:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-16 11:57:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-11-16 11:57:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 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-16 11:57:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-16 11:57:11,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-11-16 11:57:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:11,013 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-16 11:57:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-16 11:57:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-16 11:57:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:57:11,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:11,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:11,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 11:57:11,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:11,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-16 11:57:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:11,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235655515] [2022-11-16 11:57:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:12,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235655515] [2022-11-16 11:57:12,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235655515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:12,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518144710] [2022-11-16 11:57:12,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:57:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:12,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:12,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:57:12,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:57:12,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:12,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:57:12,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:13,080 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 13 treesize of output 9 [2022-11-16 11:57:13,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:13,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 11:57:13,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:13,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 11:57:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:57:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:13,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:14,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-16 11:57:14,481 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 20 treesize of output 16 [2022-11-16 11:57:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518144710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:14,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:14,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-16 11:57:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501235650] [2022-11-16 11:57:14,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:14,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:57:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:57:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-11-16 11:57:14,704 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-16 11:57:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:17,123 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-16 11:57:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:57:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-16 11:57:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:17,125 INFO L225 Difference]: With dead ends: 76 [2022-11-16 11:57:17,125 INFO L226 Difference]: Without dead ends: 61 [2022-11-16 11:57:17,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 11:57:17,126 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:17,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 73 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 11:57:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-16 11:57:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-16 11:57:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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-16 11:57:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-16 11:57:17,149 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-11-16 11:57:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:17,150 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-16 11:57:17,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-16 11:57:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-16 11:57:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:57:17,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:17,151 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:17,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:17,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:17,358 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-11-16 11:57:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:17,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745223020] [2022-11-16 11:57:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:57:17,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745223020] [2022-11-16 11:57:17,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745223020] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217631373] [2022-11-16 11:57:17,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:57:17,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:17,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:17,824 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:17,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:57:17,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:57:17,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:17,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:57:17,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:57:18,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:57:18,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217631373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:18,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:18,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-16 11:57:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396164443] [2022-11-16 11:57:18,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:57:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:57:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:57:18,989 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-16 11:57:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:19,882 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-11-16 11:57:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:57:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-16 11:57:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:19,884 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:57:19,884 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 11:57:19,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:57:19,885 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:19,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 42 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:57:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 11:57:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-16 11:57:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-16 11:57:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-16 11:57:19,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-11-16 11:57:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:19,903 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-16 11:57:19,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-16 11:57:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-16 11:57:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:57:19,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:19,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:19,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:57:20,112 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-11-16 11:57:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11426307] [2022-11-16 11:57:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11426307] [2022-11-16 11:57:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11426307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031392647] [2022-11-16 11:57:20,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:57:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:20,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:20,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:57:20,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 11:57:20,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:20,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:57:20,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:21,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:57:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031392647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:21,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:21,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-16 11:57:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333496530] [2022-11-16 11:57:21,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:21,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:57:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:21,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:57:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:57:21,776 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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-16 11:57:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:22,897 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-16 11:57:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:57:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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-16 11:57:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:22,899 INFO L225 Difference]: With dead ends: 57 [2022-11-16 11:57:22,899 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 11:57:22,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:57:22,900 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 101 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:22,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 24 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:57:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 11:57:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-16 11:57:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-16 11:57:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-16 11:57:22,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-11-16 11:57:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:22,914 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-16 11:57:22,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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-16 11:57:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-16 11:57:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:57:22,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:22,916 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:22,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:23,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:57:23,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-11-16 11:57:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:23,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617563602] [2022-11-16 11:57:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:32,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617563602] [2022-11-16 11:57:32,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617563602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:32,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748002489] [2022-11-16 11:57:32,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:57:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:32,546 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:32,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:57:32,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:57:32,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:32,700 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-16 11:57:32,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:32,721 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-16 11:57:32,750 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 10 treesize of output 8 [2022-11-16 11:57:32,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:57:33,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:57:33,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:57:33,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:57:34,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 27 [2022-11-16 11:57:35,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 45 [2022-11-16 11:57:36,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:36,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:36,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:36,552 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 67 treesize of output 52 [2022-11-16 11:57:37,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:37,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:37,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:37,777 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 70 treesize of output 62 [2022-11-16 11:57:38,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:57:38,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:38,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:38,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:38,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-16 11:57:39,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:57:39,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2022-11-16 11:57:40,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:40,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:57:40,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2022-11-16 11:57:41,399 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 87 treesize of output 63 [2022-11-16 11:57:41,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 90 treesize of output 42 [2022-11-16 11:57:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:42,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:17,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:58:17,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-11-16 11:58:20,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (+ 2 .cse4) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15)))))) (+ .cse4 4)) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-11-16 11:58:23,051 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ 7 .cse9))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 5 .cse9) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15))))))) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-11-16 11:58:26,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (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|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .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_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 10)) (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse10)) (< (+ .cse9 8) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse10 .cse15)))))))))))) is different from false [2022-11-16 11:58:29,192 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ .cse9 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse10)) (< (+ .cse9 11) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse10 .cse15)))))))))))) is different from false [2022-11-16 11:58:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-16 11:58:29,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748002489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:58:29,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:58:29,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 83 [2022-11-16 11:58:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667944566] [2022-11-16 11:58:29,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:29,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-16 11:58:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:29,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-16 11:58:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=5424, Unknown=4, NotChecked=628, Total=6806 [2022-11-16 11:58:29,561 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 83 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 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-16 11:58:33,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse11 .cse10)) (.cse0 (select .cse11 .cse9)) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse11 .cse8))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 3) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse7)) .cse10 (+ .cse1 2)) .cse9 (+ .cse0 2)) .cse8 (+ 2 .cse12))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2 .cse5 .cse6 .cse7))))))) (not (= .cse7 1)) (not (= .cse12 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse13 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse13)) (< (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse14 .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse13 .cse18)))))) (+ .cse19 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse20)) (< (+ .cse19 11) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse20 .cse25)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-11-16 11:58:42,028 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-16 11:58:42,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-16 11:58:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:58:42,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2371 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=752, Invalid=5425, Unknown=5, NotChecked=790, Total=6972 [2022-11-16 11:58:42,032 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:42,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 20 Unchecked, 1.6s Time] [2022-11-16 11:58:42,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:42,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:58:42,236 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-11-16 11:58:42,239 INFO L158 Benchmark]: Toolchain (without parser) took 225257.71ms. Allocated memory was 123.7MB in the beginning and 205.5MB in the end (delta: 81.8MB). Free memory was 83.5MB in the beginning and 120.3MB in the end (delta: -36.8MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 123.7MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.50ms. Allocated memory is still 123.7MB. Free memory was 83.3MB in the beginning and 97.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.30ms. Allocated memory is still 123.7MB. Free memory was 97.1MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: Boogie Preprocessor took 66.25ms. Allocated memory is still 123.7MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: RCFGBuilder took 398.06ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 82.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:58:42,240 INFO L158 Benchmark]: TraceAbstraction took 224236.24ms. Allocated memory was 123.7MB in the beginning and 205.5MB in the end (delta: 81.8MB). Free memory was 81.3MB in the beginning and 120.3MB in the end (delta: -39.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-11-16 11:58:42,241 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 123.7MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.50ms. Allocated memory is still 123.7MB. Free memory was 83.3MB in the beginning and 97.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.30ms. Allocated memory is still 123.7MB. Free memory was 97.1MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.25ms. Allocated memory is still 123.7MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.06ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 82.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 224236.24ms. Allocated memory was 123.7MB in the beginning and 205.5MB in the end (delta: 81.8MB). Free memory was 81.3MB in the beginning and 120.3MB in the end (delta: -39.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8 --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- 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-e04fb08 [2022-11-16 11:58:44,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:58:44,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:58:44,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:58:44,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:58:44,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:58:44,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:58:44,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:58:44,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:58:44,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:58:44,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:58:44,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:58:44,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:58:44,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:58:44,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:58:44,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:58:44,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:58:44,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:58:44,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:58:44,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:58:44,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:58:44,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:58:44,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:58:44,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:58:44,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:58:44,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:58:44,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:58:44,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:58:44,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:58:44,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:58:44,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:58:44,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:58:44,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:58:44,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:58:44,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:58:44,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:58:44,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:58:44,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:58:44,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:58:44,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:58:44,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:58:44,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 11:58:44,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:58:44,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:58:44,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:58:44,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:58:44,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:58:44,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:58:44,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:58:44,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:58:44,900 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:58:44,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:58:44,901 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:58:44,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:58:44,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:58:44,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:58:44,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:58:44,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:58:44,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:58:44,903 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:58:44,904 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:58:44,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:58:44,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:58:44,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:58:44,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:58:44,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:58:44,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:58:44,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:58:44,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:58:44,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:58:44,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:58:44,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:58:44,907 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:58:44,908 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:58:44,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:58:44,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:58:44,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:58:44,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:58:44,909 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-11-16 11:58:45,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:58:45,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:58:45,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:58:45,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:58:45,445 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:58:45,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-11-16 11:58:45,517 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/7a566e372/1adcc2d8fd4042aaa8ac294976bf67a3/FLAG141f5a6e9 [2022-11-16 11:58:46,073 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:58:46,074 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c [2022-11-16 11:58:46,082 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/7a566e372/1adcc2d8fd4042aaa8ac294976bf67a3/FLAG141f5a6e9 [2022-11-16 11:58:46,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/data/7a566e372/1adcc2d8fd4042aaa8ac294976bf67a3 [2022-11-16 11:58:46,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:58:46,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:58:46,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:58:46,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:58:46,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:58:46,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:46,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fb7091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46, skipping insertion in model container [2022-11-16 11:58:46,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:46,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:58:46,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:58:46,753 WARN L229 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-16 11:58:46,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:58:46,834 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:58:46,886 WARN L229 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_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-11-16 11:58:46,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:58:46,934 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:58:46,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46 WrapperNode [2022-11-16 11:58:46,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:58:46,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:58:46,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:58:46,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:58:46,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:46,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:46,979 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-11-16 11:58:46,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:58:46,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:58:46,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:58:46,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:58:46,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:46,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,044 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:58:47,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:58:47,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:58:47,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:58:47,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (1/1) ... [2022-11-16 11:58:47,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:58:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:47,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:58:47,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:58:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:58:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:58:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:58:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-16 11:58:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:58:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:58:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:58:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:58:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-16 11:58:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:58:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:58:47,246 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:58:47,249 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:58:47,517 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:58:47,523 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:58:47,523 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:58:47,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:58:47 BoogieIcfgContainer [2022-11-16 11:58:47,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:58:47,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:58:47,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:58:47,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:58:47,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:58:46" (1/3) ... [2022-11-16 11:58:47,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6840a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:47, skipping insertion in model container [2022-11-16 11:58:47,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:46" (2/3) ... [2022-11-16 11:58:47,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6840a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:47, skipping insertion in model container [2022-11-16 11:58:47,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:58:47" (3/3) ... [2022-11-16 11:58:47,537 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-11-16 11:58:47,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:58:47,562 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:58:47,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:58:47,641 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;@1eff647d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:58:47,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:58:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-16 11:58:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:58:47,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:47,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:47,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:58:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-16 11:58:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:47,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106466092] [2022-11-16 11:58:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:58:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:47,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:58:47,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:58:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:47,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:58:47,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:47,896 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-16 11:58:47,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:47,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106466092] [2022-11-16 11:58:47,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106466092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:47,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:47,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:58:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874858851] [2022-11-16 11:58:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:47,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:58:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:58:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:58:47,943 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 11:58:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:47,980 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-16 11:58:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:58:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-16 11:58:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:48,009 INFO L225 Difference]: With dead ends: 40 [2022-11-16 11:58:48,009 INFO L226 Difference]: Without dead ends: 18 [2022-11-16 11:58:48,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-16 11:58:48,017 INFO L413 NwaCegarLoop]: 26 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, 26 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-16 11:58:48,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:58:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-16 11:58:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-16 11:58:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-16 11:58:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-16 11:58:48,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-16 11:58:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:48,090 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-16 11:58:48,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 11:58:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-16 11:58:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:58:48,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:48,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:48,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-16 11:58:48,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:58:48,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:58:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-16 11:58:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:48,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389139438] [2022-11-16 11:58:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:48,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:58:48,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:48,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:58:48,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:58:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:48,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:58:48,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:48,747 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-16 11:58:48,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:48,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:48,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389139438] [2022-11-16 11:58:48,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389139438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:48,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:48,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:58:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015766085] [2022-11-16 11:58:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:48,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:58:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:58:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:58:48,769 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 11:58:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:49,034 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-16 11:58:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:58:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-16 11:58:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:49,037 INFO L225 Difference]: With dead ends: 36 [2022-11-16 11:58:49,037 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 11:58:49,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:58:49,041 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:49,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:58:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 11:58:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-16 11:58:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-16 11:58:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-16 11:58:49,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-16 11:58:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:49,060 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-16 11:58:49,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 11:58:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-16 11:58:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:58:49,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:49,063 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] [2022-11-16 11:58:49,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:49,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:58:49,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:58:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-16 11:58:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:49,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923786672] [2022-11-16 11:58:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:58:49,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:49,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:58:49,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:58:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:49,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:58:49,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:49,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:58:49,605 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 18 treesize of output 19 [2022-11-16 11:58:49,633 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 10 treesize of output 8 [2022-11-16 11:58:49,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:58:49,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:58:50,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:58:50,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-11-16 11:58:50,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:58:50,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-11-16 11:58:50,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:58:50,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2022-11-16 11:58:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:58:50,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:58,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:58:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:58:58,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923786672] [2022-11-16 11:58:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923786672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:58:58,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:58:58,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-16 11:58:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282384271] [2022-11-16 11:58:58,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:58,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 11:58:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 11:58:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=448, Unknown=1, NotChecked=0, Total=552 [2022-11-16 11:58:58,760 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 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-16 11:59:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:05,072 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-16 11:59:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:59:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 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 20 [2022-11-16 11:59:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:05,074 INFO L225 Difference]: With dead ends: 50 [2022-11-16 11:59:05,075 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 11:59:05,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=251, Invalid=1008, Unknown=1, NotChecked=0, Total=1260 [2022-11-16 11:59:05,077 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:05,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 57 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 47 Unchecked, 2.5s Time] [2022-11-16 11:59:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 11:59:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-11-16 11:59:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-16 11:59:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-16 11:59:05,089 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-11-16 11:59:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:05,090 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-16 11:59:05,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 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-16 11:59:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-16 11:59:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:59:05,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:05,091 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] [2022-11-16 11:59:05,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-16 11:59:05,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:05,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-16 11:59:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:05,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589857991] [2022-11-16 11:59:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:05,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:05,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:05,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:59:05,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:59:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:05,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:59:05,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:05,434 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-16 11:59:05,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:59:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:05,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:05,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-16 11:59:05,577 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-16 11:59:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:05,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:05,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589857991] [2022-11-16 11:59:05,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589857991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:59:05,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:59:05,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-16 11:59:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238420135] [2022-11-16 11:59:05,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:05,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:59:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:59:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:59:05,613 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-16 11:59:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:05,878 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-16 11:59:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:59:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 20 [2022-11-16 11:59:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:05,882 INFO L225 Difference]: With dead ends: 49 [2022-11-16 11:59:05,882 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 11:59:05,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:59:05,884 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:05,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 11:59:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-16 11:59:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-16 11:59:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-16 11:59:05,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-11-16 11:59:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:05,912 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-16 11:59:05,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-16 11:59:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-16 11:59:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:59:05,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:05,923 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] [2022-11-16 11:59:05,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:06,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:06,138 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-16 11:59:06,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:06,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749356005] [2022-11-16 11:59:06,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:59:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:06,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:59:06,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:59:06,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:59:06,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:59:06,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:59:06,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:06,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:06,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749356005] [2022-11-16 11:59:06,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749356005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:59:06,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:59:06,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-16 11:59:06,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237362014] [2022-11-16 11:59:06,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:06,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:59:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:06,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:59:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:59:06,813 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-16 11:59:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:07,677 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-16 11:59:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:59:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 22 [2022-11-16 11:59:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:07,680 INFO L225 Difference]: With dead ends: 63 [2022-11-16 11:59:07,680 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 11:59:07,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:59:07,682 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:07,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 23 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:59:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 11:59:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-11-16 11:59:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-16 11:59:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-16 11:59:07,693 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-16 11:59:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:07,693 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-16 11:59:07,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-16 11:59:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-16 11:59:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:59:07,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:07,695 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] [2022-11-16 11:59:07,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:07,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:07,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-16 11:59:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:07,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106907575] [2022-11-16 11:59:07,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:59:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:07,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:59:07,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:59:08,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:59:08,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:59:08,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:59:08,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:08,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:08,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:08,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106907575] [2022-11-16 11:59:08,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106907575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:59:08,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:59:08,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-11-16 11:59:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012640167] [2022-11-16 11:59:08,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:08,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:59:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:59:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:59:08,828 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-16 11:59:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:10,168 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-16 11:59:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:59:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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 22 [2022-11-16 11:59:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:10,173 INFO L225 Difference]: With dead ends: 72 [2022-11-16 11:59:10,174 INFO L226 Difference]: Without dead ends: 57 [2022-11-16 11:59:10,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-16 11:59:10,175 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 217 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:10,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:59:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-16 11:59:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-11-16 11:59:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 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-16 11:59:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-11-16 11:59:10,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-11-16 11:59:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:10,198 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-11-16 11:59:10,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-16 11:59:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-11-16 11:59:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:59:10,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:10,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:10,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:10,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:10,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-16 11:59:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435926889] [2022-11-16 11:59:10,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:59:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:59:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:10,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:59:10,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:59:10,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:59:10,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:59:10,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 11:59:10,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:10,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:10,695 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 18 treesize of output 19 [2022-11-16 11:59:10,722 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 10 treesize of output 8 [2022-11-16 11:59:10,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:59:10,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:59:11,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:11,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 11:59:11,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:11,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2022-11-16 11:59:12,395 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 11:59:12,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2022-11-16 11:59:12,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:12,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-11-16 11:59:13,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:13,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 83 [2022-11-16 11:59:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:13,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:05,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:00:05,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-11-16 12:00:17,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:17,872 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 12:00:17,872 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 1 [2022-11-16 12:00:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:17,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:17,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435926889] [2022-11-16 12:00:17,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435926889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:17,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:17,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-11-16 12:00:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640817631] [2022-11-16 12:00:17,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:17,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 12:00:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 12:00:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1056, Unknown=19, NotChecked=0, Total=1260 [2022-11-16 12:00:17,879 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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-16 12:00:30,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select .cse11 .cse8)) (.cse12 (select .cse11 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse1 (_ bv1 32))) (= ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32))) (let ((.cse2 (let ((.cse10 (bvadd (_ bv2 32) .cse12))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse11 |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse8 (bvadd .cse1 (_ bv2 32)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (bvadd ((_ sign_extend 32) .cse10) (concat (select .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse4 ((_ extract 31 0) .cse9)) (.cse3 ((_ extract 63 32) .cse9))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse7 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (= .cse12 (_ bv1 32))))))) (bvslt (_ bv1 32) c_~N~0) (not (bvsle c_~N~0 (_ bv0 32))) (= ((_ extract 31 0) (_ bv0 64)) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse13 .cse7) ((_ extract 63 32) (_ bv0 64))))) is different from false [2022-11-16 12:00:33,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:00:42,180 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 64 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:00:44,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:00:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:47,944 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-11-16 12:00:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:00:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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 27 [2022-11-16 12:00:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:47,945 INFO L225 Difference]: With dead ends: 66 [2022-11-16 12:00:47,946 INFO L226 Difference]: Without dead ends: 54 [2022-11-16 12:00:47,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 85.6s TimeCoverageRelationStatistics Valid=424, Invalid=2315, Unknown=21, NotChecked=102, Total=2862 [2022-11-16 12:00:47,948 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 87 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:47,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 66 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 349 Invalid, 2 Unknown, 193 Unchecked, 8.5s Time] [2022-11-16 12:00:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-16 12:00:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-11-16 12:00:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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-16 12:00:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-16 12:00:47,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-11-16 12:00:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:47,974 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-16 12:00:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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-16 12:00:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-16 12:00:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:00:47,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:47,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:47,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-16 12:00:48,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:48,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-16 12:00:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:48,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552528837] [2022-11-16 12:00:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:48,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:48,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:00:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:00:48,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:48,354 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 13 treesize of output 9 [2022-11-16 12:00:48,527 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:00:48,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 12:00:48,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:00:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:00:48,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:48,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-16 12:00:48,830 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 20 treesize of output 16 [2022-11-16 12:00:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:00:48,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552528837] [2022-11-16 12:00:48,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552528837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:48,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:48,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-16 12:00:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181221125] [2022-11-16 12:00:48,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:00:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:48,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:00:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:00:48,949 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 12:00:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:49,633 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-16 12:00:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:00:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 27 [2022-11-16 12:00:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:49,635 INFO L225 Difference]: With dead ends: 69 [2022-11-16 12:00:49,635 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 12:00:49,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:00:49,636 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:49,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:00:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 12:00:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-16 12:00:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-16 12:00:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-16 12:00:49,646 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-11-16 12:00:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:49,646 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-16 12:00:49,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 12:00:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-16 12:00:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:00:49,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:49,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:49,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:49,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:49,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-11-16 12:00:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:49,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398688806] [2022-11-16 12:00:49,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:00:49,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:49,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:49,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:49,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:00:49,978 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-16 12:00:49,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:00:49,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:00:49,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:00:50,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:00:52,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:52,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398688806] [2022-11-16 12:00:52,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398688806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:52,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:52,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-11-16 12:00:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607297022] [2022-11-16 12:00:52,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:00:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:00:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:00:52,375 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 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-16 12:00:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:55,672 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-11-16 12:00:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:00:55,673 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 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 29 [2022-11-16 12:00:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:55,673 INFO L225 Difference]: With dead ends: 88 [2022-11-16 12:00:55,674 INFO L226 Difference]: Without dead ends: 69 [2022-11-16 12:00:55,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 12:00:55,676 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 311 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:55,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 31 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:00:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-16 12:00:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-11-16 12:00:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 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-16 12:00:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-16 12:00:55,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-11-16 12:00:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:55,690 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-16 12:00:55,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 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-16 12:00:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-16 12:00:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:00:55,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:55,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:55,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:55,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:55,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-11-16 12:00:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:55,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974231294] [2022-11-16 12:00:55,906 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:00:55,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:55,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:55,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:00:56,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-16 12:00:56,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:00:56,113 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 12:00:56,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:56,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:56,299 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 18 treesize of output 19 [2022-11-16 12:00:56,337 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 10 treesize of output 8 [2022-11-16 12:00:56,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:00:56,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:00:56,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:00:57,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:00:57,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 12:00:58,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:00:58,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-16 12:00:59,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:00:59,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2022-11-16 12:00:59,888 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-16 12:00:59,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2022-11-16 12:01:01,786 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-16 12:01:01,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 96 [2022-11-16 12:01:03,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:03,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2022-11-16 12:01:04,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:04,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 142 [2022-11-16 12:01:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:04,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:50,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:03:50,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-11-16 12:04:26,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:04:26,456 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 12:04:26,456 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2506 treesize of output 1 [2022-11-16 12:04:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:04:26,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:04:26,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974231294] [2022-11-16 12:04:26,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974231294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:04:26,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:04:26,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-11-16 12:04:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711402761] [2022-11-16 12:04:26,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:04:26,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 12:04:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:04:26,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 12:04:26,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1814, Unknown=38, NotChecked=0, Total=2162 [2022-11-16 12:04:26,465 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-16 12:04:41,224 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse78 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse77 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse74 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse78))) (let ((.cse61 (select .cse74 .cse75)) (.cse72 (select .cse74 .cse77))) (let ((.cse22 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse78)) (.cse57 (store .cse74 .cse77 (bvadd (_ bv2 32) .cse72))) (.cse76 (bvadd (_ bv2 32) .cse61))) (let ((.cse24 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse13 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse15 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (store .cse57 .cse75 .cse76)) (.cse73 (select .cse74 .cse22))) (let ((.cse2 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse35 (store .cse74 .cse75 .cse76)) (.cse23 (bvadd (_ bv2 32) .cse73)) (.cse5 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse6 (not (= .cse73 (_ bv1 32)))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse58 (not (= .cse72 (_ bv1 32)))) (.cse1 (= .cse24 (let ((.cse62 (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse70 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse71 (bvadd ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse70 .cse12) (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse69 ((_ extract 31 0) .cse71)) (.cse68 ((_ extract 63 32) .cse71))) (let ((.cse66 (store (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse69) .cse12 .cse68))) (let ((.cse67 (bvadd ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse68 .cse69)))) (let ((.cse64 ((_ extract 31 0) .cse67)) (.cse63 ((_ extract 63 32) .cse67))) (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse12 .cse63)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))))) (.cse59 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse3 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse4 (not (= .cse61 (_ bv1 32)))) (.cse60 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (or .cse1 .cse2 .cse3 .cse4) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse5 .cse2 .cse6 (= (let ((.cse7 (let ((.cse20 (store .cse21 .cse22 .cse23))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse18 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (bvadd (concat (select .cse18 .cse12) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse17 ((_ extract 31 0) .cse19)) (.cse16 ((_ extract 63 32) .cse19))) (let ((.cse11 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse12 .cse16))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse16 .cse17)))) (let ((.cse9 ((_ extract 31 0) .cse14)) (.cse8 ((_ extract 63 32) .cse14))) (bvadd (concat .cse8 .cse9) ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9) .cse12 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse24) .cse3 .cse4) (or (= .cse24 (let ((.cse25 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse12) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse12 .cse31))) (let ((.cse30 (bvadd ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse31 .cse32)))) (let ((.cse27 ((_ extract 31 0) .cse30)) (.cse26 ((_ extract 63 32) .cse30))) (bvadd (concat .cse26 .cse27) ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse12 .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))) .cse3 .cse4) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse24 (let ((.cse36 (let ((.cse46 (store .cse35 .cse22 .cse23))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (bvadd (concat (select .cse44 .cse12) (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse43 ((_ extract 31 0) .cse45)) (.cse42 ((_ extract 63 32) .cse45))) (let ((.cse38 (store (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse12 .cse42))) (let ((.cse41 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse42 .cse43)))) (let ((.cse40 ((_ extract 63 32) .cse41)) (.cse39 ((_ extract 31 0) .cse41))) (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse39) .cse12 .cse40)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (concat .cse40 .cse39)))))))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))) .cse5 .cse6 .cse3 .cse4) (or (= .cse24 (let ((.cse47 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57))) (let ((.cse55 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (bvadd (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse54 ((_ extract 31 0) .cse56)) (.cse53 ((_ extract 63 32) .cse56))) (let ((.cse51 (store (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse54) .cse12 .cse53))) (let ((.cse52 (bvadd ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse53 .cse54)))) (let ((.cse49 ((_ extract 31 0) .cse52)) (.cse48 ((_ extract 63 32) .cse52))) (bvadd (concat .cse48 .cse49) ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse49) .cse12 .cse48)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47)))) .cse58 .cse59) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse0 (or .cse58 .cse1 .cse59 .cse3 .cse4) (= (select .cse60 .cse12) ((_ extract 63 32) (_ bv0 64)))))))))) is different from true [2022-11-16 12:05:42,920 WARN L233 SmtUtils]: Spent 29.01s on a formula simplification. DAG size of input: 115 DAG size of output: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:05:45,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:05:47,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:06:32,818 WARN L233 SmtUtils]: Spent 21.65s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:06:49,292 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 130 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:06:52,561 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse64 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse63 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse64)) (.cse33 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse64))) (let ((.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse64)) (.cse60 (select .cse33 .cse34)) (.cse61 (select .cse33 .cse63))) (let ((.cse46 (store .cse33 .cse63 (bvadd (_ bv2 32) .cse61))) (.cse35 (bvadd (_ bv2 32) .cse60)) (.cse62 (select .cse33 .cse17))) (let ((.cse18 (bvadd (_ bv2 32) .cse62)) (.cse0 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse1 (not (= .cse62 (_ bv1 32)))) (.cse47 (not (= .cse61 (_ bv1 32)))) (.cse19 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse16 (store .cse46 .cse34 .cse35)) (.cse48 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse20 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse21 (not (= .cse60 (_ bv1 32)))) (.cse49 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (bvslt (_ bv3 32) c_~N~0)) (or .cse0 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse1 (= (let ((.cse2 (let ((.cse15 (store .cse16 .cse17 .cse18))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd (concat (select .cse13 .cse7) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse6 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse7 .cse11))) (let ((.cse9 (bvadd ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse11 .cse12)))) (let ((.cse4 ((_ extract 31 0) .cse9)) (.cse3 ((_ extract 63 32) .cse9))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse7 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) .cse19) .cse20 .cse21) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse19 (let ((.cse22 (let ((.cse32 (store (store .cse33 .cse34 .cse35) .cse17 .cse18))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32))) (let ((.cse30 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (bvadd (concat (select .cse30 .cse7) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse29 ((_ extract 31 0) .cse31)) (.cse28 ((_ extract 63 32) .cse31))) (let ((.cse24 (store (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29) .cse7 .cse28))) (let ((.cse27 (bvadd ((_ sign_extend 32) (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse28 .cse29)))) (let ((.cse26 ((_ extract 63 32) .cse27)) (.cse25 ((_ extract 31 0) .cse27))) (bvadd ((_ sign_extend 32) (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25) .cse7 .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (concat .cse26 .cse25)))))))))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22)))) .cse0 .cse1 .cse20 .cse21) (or (= .cse19 (let ((.cse36 (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (bvadd (concat (select .cse44 .cse7) (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse43 ((_ extract 31 0) .cse45)) (.cse42 ((_ extract 63 32) .cse45))) (let ((.cse40 (store (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse7 .cse42))) (let ((.cse41 (bvadd ((_ sign_extend 32) (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse42 .cse43)))) (let ((.cse38 ((_ extract 31 0) .cse41)) (.cse37 ((_ extract 63 32) .cse41))) (bvadd (concat .cse37 .cse38) ((_ sign_extend 32) (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38) .cse7 .cse37)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))) .cse47 .cse48) (= ((_ extract 31 0) (_ bv0 64)) (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse47 (= .cse19 (let ((.cse50 (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse58 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse58 .cse7) (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse57 ((_ extract 31 0) .cse59)) (.cse56 ((_ extract 63 32) .cse59))) (let ((.cse54 (store (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57) .cse7 .cse56))) (let ((.cse55 (bvadd ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse56 .cse57)))) (let ((.cse52 ((_ extract 31 0) .cse55)) (.cse51 ((_ extract 63 32) .cse55))) (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse7 .cse51)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))) .cse48 .cse20 .cse21) (= (select .cse49 .cse7) ((_ extract 63 32) (_ bv0 64))))))))) is different from true [2022-11-16 12:06:56,340 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse28 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse28)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select .cse6 .cse8)) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse13 (select .cse2 .cse26)) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse28)) (.cse20 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd ((_ sign_extend 32) (select .cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse28))) (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64))))) (.cse12 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= ((_ extract 63 32) .cse0) .cse1) (not (bvslt (_ bv3 32) c_~N~0)) (= (select .cse2 .cse3) (_ bv3 32)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse1 .cse12) ((_ sign_extend 32) .cse13)))) (let ((.cse9 ((_ extract 63 32) .cse11)) (.cse7 ((_ extract 31 0) .cse11))) (bvadd ((_ sign_extend 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse9 .cse7)))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (let ((.cse27 (select .cse2 .cse10))) (or (= .cse4 (let ((.cse14 (let ((.cse25 (store (store .cse2 .cse26 (bvadd (_ bv2 32) .cse13)) .cse10 (bvadd (_ bv2 32) .cse27)))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (let ((.cse23 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse24 (bvadd (concat (select .cse23 .cse8) (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse22 ((_ extract 31 0) .cse24)) (.cse21 ((_ extract 63 32) .cse24))) (let ((.cse16 (store (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse22) .cse8 .cse21))) (let ((.cse19 (bvadd ((_ sign_extend 32) (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (concat .cse21 .cse22)))) (let ((.cse18 ((_ extract 63 32) .cse19)) (.cse17 ((_ extract 31 0) .cse19))) (bvadd ((_ sign_extend 32) (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse8 .cse18)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (concat .cse18 .cse17)))))))))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14)))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (= .cse27 (_ bv1 32))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (= .cse13 (_ bv1 32))))) (= (_ bv3 32) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (bvslt (_ bv2 32) c_~N~0) (= (_ bv3 32) (select .cse2 .cse20)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) .cse0) .cse12))))) is different from false [2022-11-16 12:06:58,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:07:01,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:07:03,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:07:05,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:07:14,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse81 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse80 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse81)) (.cse79 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse75 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse81))) (let ((.cse74 (select .cse79 .cse75)) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse81)) (.cse77 (select .cse79 .cse80))) (let ((.cse61 (store .cse79 .cse80 (bvadd (_ bv2 32) .cse77))) (.cse78 (select .cse79 .cse17)) (.cse76 (bvadd (_ bv2 32) .cse74))) (let ((.cse39 (store .cse79 .cse75 .cse76)) (.cse18 (bvadd (_ bv2 32) .cse78)) (.cse0 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse1 (not (= .cse78 (_ bv1 32)))) (.cse62 (not (= .cse77 (_ bv1 32)))) (.cse19 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (store .cse61 .cse75 .cse76)) (.cse63 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse20 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse21 (not (= .cse74 (_ bv1 32))))) (and (not (bvslt (_ bv3 32) c_~N~0)) (or .cse0 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse1 (= (let ((.cse2 (let ((.cse15 (store .cse16 .cse17 .cse18))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd (concat (select .cse13 .cse7) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse6 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse7 .cse11))) (let ((.cse9 (bvadd ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse11 .cse12)))) (let ((.cse4 ((_ extract 31 0) .cse9)) (.cse3 ((_ extract 63 32) .cse9))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse7 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) .cse19) .cse20 .cse21) (exists ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1.base| (_ BitVec 32))) (let ((.cse25 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (select .cse25 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (select .cse25 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse23 (bvadd (let ((.cse27 (bvadd ((_ sign_extend 32) (_ bv3 32)) (let ((.cse28 (bvadd ((_ sign_extend 32) .cse26) (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28)))))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) ((_ sign_extend 32) .cse24)))) (and (= (select .cse22 .cse7) ((_ extract 63 32) .cse23)) (= (_ bv3 32) .cse24) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|) ((_ extract 31 0) .cse23)) (= (_ bv3 32) (select .cse25 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (= (_ bv3 32) .cse26)))))) (or (= .cse19 (let ((.cse29 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse37 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (bvadd (concat (select .cse37 .cse7) (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse36 ((_ extract 31 0) .cse38)) (.cse35 ((_ extract 63 32) .cse38))) (let ((.cse33 (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse7 .cse35))) (let ((.cse34 (bvadd ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse35 .cse36)))) (let ((.cse31 ((_ extract 31 0) .cse34)) (.cse30 ((_ extract 63 32) .cse34))) (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse7 .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))) .cse20 .cse21) (or (= .cse19 (let ((.cse40 (let ((.cse50 (store .cse39 .cse17 .cse18))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50))) (let ((.cse48 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (bvadd (concat (select .cse48 .cse7) (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse47 ((_ extract 31 0) .cse49)) (.cse46 ((_ extract 63 32) .cse49))) (let ((.cse42 (store (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse47) .cse7 .cse46))) (let ((.cse45 (bvadd ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse46 .cse47)))) (let ((.cse44 ((_ extract 63 32) .cse45)) (.cse43 ((_ extract 31 0) .cse45))) (bvadd ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse7 .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (concat .cse44 .cse43)))))))))))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))) .cse0 .cse1 .cse20 .cse21) (bvslt (_ bv2 32) c_~N~0) (or (= .cse19 (let ((.cse51 (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse59 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (bvadd (concat (select .cse59 .cse7) (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse58 ((_ extract 31 0) .cse60)) (.cse57 ((_ extract 63 32) .cse60))) (let ((.cse55 (store (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58) .cse7 .cse57))) (let ((.cse56 (bvadd ((_ sign_extend 32) (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse57 .cse58)))) (let ((.cse53 ((_ extract 31 0) .cse56)) (.cse52 ((_ extract 63 32) .cse56))) (bvadd (concat .cse52 .cse53) ((_ sign_extend 32) (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53) .cse7 .cse52)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51)))) .cse62 .cse63) (or .cse62 (= .cse19 (let ((.cse64 (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse72 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse73 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse72 .cse7) (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse71 ((_ extract 31 0) .cse73)) (.cse70 ((_ extract 63 32) .cse73))) (let ((.cse68 (store (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse71) .cse7 .cse70))) (let ((.cse69 (bvadd ((_ sign_extend 32) (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse68) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse70 .cse71)))) (let ((.cse66 ((_ extract 31 0) .cse69)) (.cse65 ((_ extract 63 32) .cse69))) (bvadd (concat .cse65 .cse66) ((_ sign_extend 32) (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66) .cse7 .cse65)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))) .cse63 .cse20 .cse21))))))) is different from false [2022-11-16 12:07:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:07:15,182 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-16 12:07:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:07:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-16 12:07:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:07:15,184 INFO L225 Difference]: With dead ends: 76 [2022-11-16 12:07:15,184 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 12:07:15,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 335.6s TimeCoverageRelationStatistics Valid=432, Invalid=2728, Unknown=48, NotChecked=452, Total=3660 [2022-11-16 12:07:15,186 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 100 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 34 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:07:15,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 80 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 552 Invalid, 5 Unknown, 176 Unchecked, 30.8s Time] [2022-11-16 12:07:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 12:07:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-11-16 12:07:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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-16 12:07:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-16 12:07:15,202 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 34 [2022-11-16 12:07:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:07:15,202 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-16 12:07:15,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-16 12:07:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-16 12:07:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:07:15,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:07:15,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:07:15,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:07:15,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:15,412 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:07:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:07:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-16 12:07:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:07:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010408767] [2022-11-16 12:07:15,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:07:15,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:15,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:07:15,415 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:07:15,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:07:15,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:07:15,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:07:15,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:07:15,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:15,798 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 13 treesize of output 9 [2022-11-16 12:07:16,181 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:07:16,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 12:07:16,468 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:07:16,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 12:07:16,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:07:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:07:16,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:07:17,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-16 12:07:17,377 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 20 treesize of output 16 [2022-11-16 12:07:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:07:17,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:07:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010408767] [2022-11-16 12:07:17,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010408767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:07:17,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:07:17,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-16 12:07:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361912901] [2022-11-16 12:07:17,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:07:17,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:07:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:07:17,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:07:17,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:07:17,864 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-16 12:07:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:07:20,663 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-11-16 12:07:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:07:20,665 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-16 12:07:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:07:20,667 INFO L225 Difference]: With dead ends: 85 [2022-11-16 12:07:20,667 INFO L226 Difference]: Without dead ends: 49 [2022-11-16 12:07:20,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:07:20,668 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:07:20,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 12:07:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-16 12:07:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-11-16 12:07:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-16 12:07:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-16 12:07:20,680 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 34 [2022-11-16 12:07:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:07:20,681 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-16 12:07:20,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-16 12:07:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-16 12:07:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:07:20,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:07:20,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:07:20,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:07:20,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:20,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:07:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:07:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 7 times [2022-11-16 12:07:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:07:20,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328366535] [2022-11-16 12:07:20,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:07:20,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:20,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:07:20,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:07:20,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:07:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:07:21,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:07:21,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:07:24,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:07:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:07:28,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:07:28,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328366535] [2022-11-16 12:07:28,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328366535] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:07:28,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:07:28,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2022-11-16 12:07:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114571043] [2022-11-16 12:07:28,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:07:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 12:07:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:07:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 12:07:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:07:28,565 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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-16 12:07:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:07:37,652 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-16 12:07:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:07:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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) Word has length 36 [2022-11-16 12:07:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:07:37,654 INFO L225 Difference]: With dead ends: 104 [2022-11-16 12:07:37,654 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 12:07:37,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=551, Invalid=1899, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 12:07:37,656 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 346 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:07:37,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 29 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-16 12:07:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 12:07:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-11-16 12:07:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 70 states have internal predecessors, (78), 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-16 12:07:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-16 12:07:37,688 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 36 [2022-11-16 12:07:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:07:37,689 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-16 12:07:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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-16 12:07:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-16 12:07:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:07:37,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:07:37,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:07:37,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:07:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:37,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:07:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:07:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 8 times [2022-11-16 12:07:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:07:37,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640398976] [2022-11-16 12:07:37,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:07:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:07:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:07:37,913 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:07:37,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbb1caa0-348e-4e4b-9a36-eb57b7600f31/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:07:38,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:07:38,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:07:38,209 WARN L261 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-16 12:07:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:38,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:07:38,566 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 18 treesize of output 19 [2022-11-16 12:07:38,615 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 10 treesize of output 8 [2022-11-16 12:07:38,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:07:39,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:07:39,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:07:40,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:07:41,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:07:41,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 12:07:42,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:07:42,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-16 12:07:44,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:07:44,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 71 [2022-11-16 12:07:46,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:07:46,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 73 [2022-11-16 12:07:47,937 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-16 12:07:47,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 117 treesize of output 94 [2022-11-16 12:07:49,555 INFO L321 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-11-16 12:07:49,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 149 treesize of output 120 [2022-11-16 12:08:12,762 WARN L233 SmtUtils]: Spent 21.00s on a formula simplification. DAG size of input: 52 DAG size of output: 1 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 12:08:12,763 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-16 12:08:12,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 213 treesize of output 160 [2022-11-16 12:08:15,511 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-16 12:08:15,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 283 treesize of output 192 [2022-11-16 12:08:18,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:08:18,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 321 treesize of output 257 [2022-11-16 12:08:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:08:18,591 INFO L328 TraceCheckSpWp]: Computing backward predicates...