./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/condm.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:22:42,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:22:42,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:22:42,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:22:42,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:22:42,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:22:42,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:22:42,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:22:42,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:22:42,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:22:42,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:22:42,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:22:42,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:22:42,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:22:42,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:22:42,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:22:42,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:22:42,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:22:42,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:22:42,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:22:42,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:22:42,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:22:42,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:22:42,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:22:42,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:22:42,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:22:42,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:22:42,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:22:42,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:22:42,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:22:42,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:22:42,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:22:42,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:22:42,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:22:42,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:22:42,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:22:42,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:22:42,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:22:42,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:22:42,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:22:42,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:22:42,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:22:42,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:22:42,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:22:42,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:22:42,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:22:42,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:22:42,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:22:42,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:22:42,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:22:42,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:22:42,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:22:42,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:22:42,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:22:42,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:22:42,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:22:42,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:22:42,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:22:42,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:22:42,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:22:42,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:22:42,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:22:42,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:22:42,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:22:42,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:22:42,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:22:42,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:42,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:22:42,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:22:42,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:22:42,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:22:42,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:22:42,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:22:42,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:22:42,388 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:22:42,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:22:42,389 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-11-25 18:22:42,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:22:42,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:22:42,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:22:42,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:22:42,749 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:22:42,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/condm.c [2022-11-25 18:22:46,069 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:22:46,362 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:22:46,362 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c [2022-11-25 18:22:46,370 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/e897e24c2/bf4d74fa30d241db8f8ac9ab70b7372c/FLAG068a71f1e [2022-11-25 18:22:46,394 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/e897e24c2/bf4d74fa30d241db8f8ac9ab70b7372c [2022-11-25 18:22:46,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:22:46,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:22:46,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:46,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:22:46,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:22:46,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a91b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46, skipping insertion in model container [2022-11-25 18:22:46,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:22:46,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:22:46,678 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-25 18:22:46,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:46,712 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:22:46,728 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-25 18:22:46,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:46,751 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:22:46,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46 WrapperNode [2022-11-25 18:22:46,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:46,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:46,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:22:46,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:22:46,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,828 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2022-11-25 18:22:46,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:46,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:22:46,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:22:46,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:22:46,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:22:46,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:22:46,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:22:46,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:22:46,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (1/1) ... [2022-11-25 18:22:46,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:46,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:22:46,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:22:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:22:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:22:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:22:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:22:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:22:46,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:22:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:22:47,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:22:47,073 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:22:47,263 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:22:47,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:22:47,271 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:22:47,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:47 BoogieIcfgContainer [2022-11-25 18:22:47,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:22:47,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:22:47,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:22:47,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:22:47,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:22:46" (1/3) ... [2022-11-25 18:22:47,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:47, skipping insertion in model container [2022-11-25 18:22:47,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:46" (2/3) ... [2022-11-25 18:22:47,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:47, skipping insertion in model container [2022-11-25 18:22:47,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:47" (3/3) ... [2022-11-25 18:22:47,286 INFO L112 eAbstractionObserver]: Analyzing ICFG condm.c [2022-11-25 18:22:47,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:22:47,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:22:47,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:22:47,476 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;@65cf0f9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:22:47,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:22:47,481 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-25 18:22:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:22:47,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:47,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:47,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2022-11-25 18:22:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487407692] [2022-11-25 18:22:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:47,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487407692] [2022-11-25 18:22:47,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487407692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:47,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:47,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105223380] [2022-11-25 18:22:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:47,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:22:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:22:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:22:47,885 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.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:47,906 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-25 18:22:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:22:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-11-25 18:22:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:47,919 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:22:47,919 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 18:22:47,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:22:47,932 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-25 18:22:47,933 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-25 18:22:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 18:22:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 18:22:47,967 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-25 18:22:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-25 18:22:47,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-11-25 18:22:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:47,970 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-25 18:22:47,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-25 18:22:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:22:47,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:47,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:47,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:22:47,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2022-11-25 18:22:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359488386] [2022-11-25 18:22:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:48,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359488386] [2022-11-25 18:22:48,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359488386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:48,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:48,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:22:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258190922] [2022-11-25 18:22:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:48,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:22:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:22:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:22:48,202 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:48,313 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-11-25 18:22:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:22:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-11-25 18:22:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:48,315 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:22:48,315 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 18:22:48,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:22:48,317 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:48,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:22:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 18:22:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-25 18:22:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-25 18:22:48,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-11-25 18:22:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:48,326 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-25 18:22:48,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-25 18:22:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:22:48,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:48,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:48,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:22:48,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2022-11-25 18:22:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178310514] [2022-11-25 18:22:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:48,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178310514] [2022-11-25 18:22:48,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178310514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:22:48,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463107567] [2022-11-25 18:22:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:48,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:48,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:48,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:22:48,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:22:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:49,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:22:49,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:49,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:22:49,465 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 18:22:49,798 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 40 treesize of output 28 [2022-11-25 18:22:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:49,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:22:50,537 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 18 treesize of output 16 [2022-11-25 18:22:50,549 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 28 treesize of output 26 [2022-11-25 18:22:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:50,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463107567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:22:50,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:22:50,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 22 [2022-11-25 18:22:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260792516] [2022-11-25 18:22:50,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:22:50,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:22:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:22:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:22:50,703 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-25 18:22:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:53,260 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-11-25 18:22:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:22:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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 17 [2022-11-25 18:22:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:53,263 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:22:53,263 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:22:53,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=527, Invalid=1543, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 18:22:53,265 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 331 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:53,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 82 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:22:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:22:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2022-11-25 18:22:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 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-25 18:22:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-25 18:22:53,279 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-11-25 18:22:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:53,279 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-25 18:22:53,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-25 18:22:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-25 18:22:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:22:53,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:53,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:53,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:22:53,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:53,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -596215012, now seen corresponding path program 1 times [2022-11-25 18:22:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:53,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592128335] [2022-11-25 18:22:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592128335] [2022-11-25 18:22:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592128335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:22:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476104953] [2022-11-25 18:22:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:53,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:53,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:53,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:22:53,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:22:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:53,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:22:53,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:53,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:22:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476104953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:22:53,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:22:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 18:22:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915795451] [2022-11-25 18:22:53,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:22:53,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:22:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:53,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:22:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:22:53,852 INFO L87 Difference]: Start difference. First operand 37 states and 44 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-25 18:22:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:54,018 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-25 18:22:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:22:54,019 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 20 [2022-11-25 18:22:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:54,024 INFO L225 Difference]: With dead ends: 72 [2022-11-25 18:22:54,024 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 18:22:54,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 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-25 18:22:54,031 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:54,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 47 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:22:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 18:22:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2022-11-25 18:22:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-25 18:22:54,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2022-11-25 18:22:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:54,053 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-25 18:22:54,055 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-25 18:22:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-25 18:22:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:22:54,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:54,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:54,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:22:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:54,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash -408404582, now seen corresponding path program 2 times [2022-11-25 18:22:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:54,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872166079] [2022-11-25 18:22:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:22:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872166079] [2022-11-25 18:22:55,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872166079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:22:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124242352] [2022-11-25 18:22:55,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:22:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:55,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:22:55,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:22:55,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:22:55,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:22:55,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:22:55,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:55,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:22:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:55,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124242352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:22:55,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:22:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 23 [2022-11-25 18:22:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218881568] [2022-11-25 18:22:55,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:22:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:22:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:22:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:22:55,537 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-25 18:22:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:56,063 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-25 18:22:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:22:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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) Word has length 22 [2022-11-25 18:22:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:56,066 INFO L225 Difference]: With dead ends: 90 [2022-11-25 18:22:56,066 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 18:22:56,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=784, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:22:56,067 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 264 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:56,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 73 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:22:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 18:22:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. [2022-11-25 18:22:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-25 18:22:56,094 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 22 [2022-11-25 18:22:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:56,095 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-25 18:22:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-25 18:22:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-25 18:22:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:22:56,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:56,097 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] [2022-11-25 18:22:56,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:22:56,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:56,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2022-11-25 18:22:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:56,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793335277] [2022-11-25 18:22:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793335277] [2022-11-25 18:22:58,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793335277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:22:58,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190423709] [2022-11-25 18:22:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:58,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:22:58,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:58,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:22:58,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:22:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:58,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 18:22:58,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:58,245 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-25 18:22:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:58,336 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 21 treesize of output 20 [2022-11-25 18:22:58,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:22:58,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:58,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:58,492 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 3 case distinctions, treesize of input 42 treesize of output 41 [2022-11-25 18:22:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:58,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:58,643 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 38 treesize of output 25 [2022-11-25 18:22:59,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:59,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 31 [2022-11-25 18:22:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:59,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:01,432 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 149 treesize of output 139 [2022-11-25 18:23:01,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:23:01,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 277 [2022-11-25 18:23:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:01,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190423709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:01,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:01,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-11-25 18:23:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047539848] [2022-11-25 18:23:01,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:01,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 18:23:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:01,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 18:23:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 18:23:01,604 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 40 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:11,369 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-25 18:23:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 18:23:11,370 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:23:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:11,371 INFO L225 Difference]: With dead ends: 97 [2022-11-25 18:23:11,371 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 18:23:11,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=976, Invalid=4574, Unknown=0, NotChecked=0, Total=5550 [2022-11-25 18:23:11,374 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 445 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:11,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 231 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:23:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 18:23:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 45. [2022-11-25 18:23:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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-25 18:23:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-25 18:23:11,390 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 26 [2022-11-25 18:23:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:11,390 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-25 18:23:11,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-25 18:23:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:23:11,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:11,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:11,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:23:11,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:11,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 3 times [2022-11-25 18:23:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914176079] [2022-11-25 18:23:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914176079] [2022-11-25 18:23:14,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914176079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574767339] [2022-11-25 18:23:14,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:23:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:14,675 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:14,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:23:14,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:23:14,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:23:14,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 18:23:14,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:14,960 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-25 18:23:15,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:23:15,075 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-25 18:23:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:23:15,170 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-25 18:23:15,345 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 18:23:15,447 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 18:23:15,447 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 23 treesize of output 28 [2022-11-25 18:23:15,633 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 18:23:15,633 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 27 treesize of output 32 [2022-11-25 18:23:16,038 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 40 treesize of output 28 [2022-11-25 18:23:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:16,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:49,335 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 75 treesize of output 71 [2022-11-25 18:23:49,353 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 208 treesize of output 206 [2022-11-25 18:23:49,479 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 148 treesize of output 140 [2022-11-25 18:23:49,497 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 4915 treesize of output 4851 [2022-11-25 18:23:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574767339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:49,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:49,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-11-25 18:23:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308988968] [2022-11-25 18:23:49,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:49,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 18:23:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 18:23:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2097, Unknown=7, NotChecked=0, Total=2450 [2022-11-25 18:23:49,756 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 50 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:27:02,433 WARN L233 SmtUtils]: Spent 3.19m on a formula simplification. DAG size of input: 236 DAG size of output: 5 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:27:06,758 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse22 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse8 .cse9)) (.cse34 (mod c_~N~0 2))) (let ((.cse5 (= .cse34 0)) (.cse33 (mod .cse19 2)) (.cse35 (mod .cse22 2))) (let ((.cse3 (= .cse34 .cse35)) (.cse0 (< .cse22 0)) (.cse1 (= .cse35 0)) (.cse4 (< c_~N~0 0)) (.cse14 (= .cse33 0)) (.cse16 (< .cse19 0)) (.cse15 (= .cse33 .cse34)) (.cse2 (or (<= 0 c_~N~0) .cse5)) (.cse13 (<= (mod c_~N~0 4294967296) 536870911)) (.cse10 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (<= c_~N~0 0)) (or (and .cse0 (not .cse1)) (and .cse2 .cse3)) (or (and .cse3 .cse4) (not .cse0) .cse1) (or .cse5 (and (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse6 (select (store (store (let ((.cse7 (store (store .cse8 .cse9 v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse6 0)) (= (mod .cse6 2) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1)))))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))) (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store (let ((.cse11 (store (store .cse8 .cse9 v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))))) (or .cse5 (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_123 Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse12 (select (store (store .cse8 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (< .cse12 0)) (= (mod .cse12 2) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse8 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))))))) .cse13 (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse14 (and .cse15 .cse4) (not .cse16)) (or (and (not .cse14) .cse16) (and .cse15 .cse2)) (or (let ((.cse18 (store .cse8 .cse9 (+ .cse19 1)))) (and (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse17 (select (store (store .cse18 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse17 0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (= (mod .cse17 2) 0)))) (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse18 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))))))) .cse5) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse13) (and (not .cse13) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (let ((.cse20 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse22 1)))) (and (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse20 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse21 (select (store (store .cse20 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse21 0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (= (mod .cse21 2) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1)))))))) .cse5) (< 0 (+ c_~N~0 1)) (or (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse23 (select .cse8 0))) (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (<= .cse23 1) (not (= .cse9 0)) (<= 1 .cse23)))) (or .cse5 (and (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (forall ((v_ArrVal_123 Int)) (not (= 0 (mod (select (store (store (let ((.cse24 (store .cse8 .cse9 v_ArrVal_118))) (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse25 (select (store (store (let ((.cse26 (store .cse8 .cse9 v_ArrVal_118))) (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (< .cse25 0)) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (= (mod .cse25 2) 0))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (< 0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store (let ((.cse27 (store .cse8 (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_64|)) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse28 (select (store (store (let ((.cse29 (store .cse8 (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (= (mod .cse28 2) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (not (< .cse28 0))))) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))))) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int)) (or (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) |v_ULTIMATE.start_main_~i~0#1_64|)) (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store (let ((.cse30 (store (store .cse8 (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_65|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int)) (or (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse31 (select (store (store (let ((.cse32 (store (store .cse8 (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse31 2) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (not (< .cse31 0))))))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_65|))))))))))) is different from false [2022-11-25 18:31:33,204 WARN L233 SmtUtils]: Spent 4.33m on a formula simplification. DAG size of input: 249 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:31:35,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:37,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:39,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:41,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:43,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:31:45,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:32:21,805 WARN L233 SmtUtils]: Spent 19.36s on a formula simplification. DAG size of input: 75 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:33:54,905 WARN L233 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 292 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:33:56,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:33:58,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:00,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:02,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (mod c_~N~0 2)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse0 (= .cse17 0)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or .cse0 (and (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse1 (select (store (store (let ((.cse2 (store (store .cse3 .cse4 v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse1 0)) (= (mod .cse1 2) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1)))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))) (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store (let ((.cse6 (store (store .cse3 .cse4 v_ArrVal_115) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_123 Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse7 (select (store (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (< .cse7 0)) (= (mod .cse7 2) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))))))) (or (let ((.cse9 (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) (and (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse8 (select (store (store .cse9 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse8 0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (= (mod .cse8 2) 0)))) (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse9 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))))))) .cse0) (or (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse12 1)))) (and (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store .cse10 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse11 (select (store (store .cse10 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse11 0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (= (mod .cse11 2) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1)))))))) .cse0) (or (let ((.cse16 (mod .cse12 2))) (let ((.cse15 (= .cse17 .cse16)) (.cse13 (< .cse12 0)) (.cse14 (= .cse16 0))) (and (or (and .cse13 (not .cse14)) (and (or (<= 0 c_~N~0) .cse0) .cse15)) (or (and .cse15 (< c_~N~0 0)) (not .cse13) .cse14)))) .cse18) (or .cse0 (and (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (forall ((v_ArrVal_123 Int)) (not (= 0 (mod (select (store (store (let ((.cse19 (store .cse3 .cse4 v_ArrVal_118))) (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse20 (select (store (store (let ((.cse21 (store .cse3 .cse4 v_ArrVal_118))) (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (not (< .cse20 0)) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (= (mod .cse20 2) 0))))) (not .cse18)) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_121 Int) (v_subst_2 Int) (v_ArrVal_118 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (forall ((v_ArrVal_123 Int)) (not (= (mod (select (store (store (let ((.cse22 (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_2 1))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_64|)) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~0#1_64|)) (forall ((v_ArrVal_123 Int) (v_ArrVal_121 Int) (v_ArrVal_118 Int) (v_subst_1 Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (let ((.cse23 (select (store (store (let ((.cse24 (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_118))) (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_121) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_60| 1) c_~N~0) (= (mod .cse23 2) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_60| (+ v_subst_1 1))) (not (< .cse23 0))))) (not (< |v_ULTIMATE.start_main_~i~0#1_64| c_~N~0))))))))) is different from false [2022-11-25 18:34:04,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:06,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:08,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:10,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:12,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:14,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:16,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:18,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:34:19,273 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-25 18:34:19,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-25 18:34:19,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 626.9s TimeCoverageRelationStatistics Valid=788, Invalid=4458, Unknown=18, NotChecked=286, Total=5550 [2022-11-25 18:34:19,277 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 80 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 35.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:19,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 17 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 413 Invalid, 16 Unknown, 1 Unchecked, 35.2s Time] [2022-11-25 18:34:19,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:34:19,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:34:19,479 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_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 36 more [2022-11-25 18:34:19,482 INFO L158 Benchmark]: Toolchain (without parser) took 693078.49ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 143.6MB in the beginning and 256.7MB in the end (delta: -113.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-11-25 18:34:19,482 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:34:19,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.10ms. Allocated memory is still 174.1MB. Free memory was 143.6MB in the beginning and 132.7MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:34:19,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.74ms. Allocated memory is still 174.1MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:34:19,483 INFO L158 Benchmark]: Boogie Preprocessor took 60.67ms. Allocated memory is still 174.1MB. Free memory was 131.1MB in the beginning and 129.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:34:19,483 INFO L158 Benchmark]: RCFGBuilder took 384.11ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 118.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:34:19,484 INFO L158 Benchmark]: TraceAbstraction took 692203.90ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 117.6MB in the beginning and 256.7MB in the end (delta: -139.1MB). Peak memory consumption was 134.9kB. Max. memory is 16.1GB. [2022-11-25 18:34:19,486 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.34ms. Allocated memory is still 113.2MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.10ms. Allocated memory is still 174.1MB. Free memory was 143.6MB in the beginning and 132.7MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.74ms. Allocated memory is still 174.1MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.67ms. Allocated memory is still 174.1MB. Free memory was 131.1MB in the beginning and 129.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.11ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 118.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 692203.90ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 117.6MB in the beginning and 256.7MB in the end (delta: -139.1MB). Peak memory consumption was 134.9kB. 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_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/condm.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:34:21,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:34:21,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:34:22,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:34:22,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:34:22,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:34:22,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:34:22,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:34:22,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:34:22,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:34:22,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:34:22,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:34:22,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:34:22,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:34:22,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:34:22,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:34:22,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:34:22,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:34:22,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:34:22,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:34:22,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:34:22,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:34:22,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:34:22,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:34:22,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:34:22,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:34:22,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:34:22,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:34:22,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:34:22,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:34:22,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:34:22,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:34:22,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:34:22,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:34:22,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:34:22,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:34:22,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:34:22,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:34:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:34:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:34:22,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:34:22,083 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-25 18:34:22,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:34:22,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:34:22,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:34:22,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:34:22,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:34:22,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:34:22,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:34:22,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:34:22,115 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:34:22,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:34:22,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:34:22,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:34:22,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:34:22,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:34:22,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:34:22,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:34:22,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:34:22,118 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:34:22,118 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:34:22,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:34:22,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:34:22,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:34:22,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:34:22,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:34:22,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:34:22,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:34:22,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:34:22,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:34:22,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:34:22,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:34:22,121 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:34:22,122 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:34:22,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:34:22,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:34:22,122 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:34:22,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:34:22,123 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:34:22,123 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-11-25 18:34:22,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:34:22,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:34:22,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:34:22,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:34:22,555 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:34:22,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/condm.c [2022-11-25 18:34:25,859 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:34:26,148 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:34:26,149 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c [2022-11-25 18:34:26,161 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/aef75f562/4011ef4d75ec43e5bd057be1330c2ee4/FLAG6e42ddade [2022-11-25 18:34:26,183 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/data/aef75f562/4011ef4d75ec43e5bd057be1330c2ee4 [2022-11-25 18:34:26,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:34:26,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:34:26,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:34:26,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:34:26,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:34:26,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a6b789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26, skipping insertion in model container [2022-11-25 18:34:26,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:34:26,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:34:26,428 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-25 18:34:26,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:34:26,472 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:34:26,504 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-25 18:34:26,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:34:26,550 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:34:26,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26 WrapperNode [2022-11-25 18:34:26,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:34:26,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:34:26,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:34:26,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:34:26,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,621 INFO L138 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-11-25 18:34:26,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:34:26,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:34:26,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:34:26,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:34:26,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:34:26,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:34:26,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:34:26,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:34:26,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (1/1) ... [2022-11-25 18:34:26,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:34:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:34:26,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:34:26,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:34:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:34:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:34:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:34:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 18:34:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:34:26,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:34:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:34:26,915 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:34:26,918 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:34:27,225 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:34:27,241 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:34:27,241 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:34:27,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:34:27 BoogieIcfgContainer [2022-11-25 18:34:27,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:34:27,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:34:27,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:34:27,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:34:27,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:34:26" (1/3) ... [2022-11-25 18:34:27,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f707b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:34:27, skipping insertion in model container [2022-11-25 18:34:27,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:34:26" (2/3) ... [2022-11-25 18:34:27,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f707b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:34:27, skipping insertion in model container [2022-11-25 18:34:27,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:34:27" (3/3) ... [2022-11-25 18:34:27,253 INFO L112 eAbstractionObserver]: Analyzing ICFG condm.c [2022-11-25 18:34:27,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:34:27,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:34:27,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:34:27,408 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;@44232206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:34:27,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:34:27,415 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-25 18:34:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:34:27,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:27,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:27,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2022-11-25 18:34:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:27,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115054326] [2022-11-25 18:34:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:34:27,458 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-25 18:34:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:27,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:27,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:34:27,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 18:34:27,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:27,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:34:27,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115054326] [2022-11-25 18:34:27,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115054326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:34:27,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:34:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:34:27,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647982533] [2022-11-25 18:34:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:34:27,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:34:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:34:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:34:27,715 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.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:27,742 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-25 18:34:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:34:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-11-25 18:34:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:27,754 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:34:27,755 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 18:34:27,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:34:27,766 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-25 18:34:27,768 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-25 18:34:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 18:34:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 18:34:27,809 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-25 18:34:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-25 18:34:27,813 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-11-25 18:34:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:27,814 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-25 18:34:27,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-25 18:34:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:34:27,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:27,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:27,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 18:34:28,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2022-11-25 18:34:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:28,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856347523] [2022-11-25 18:34:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:34:28,033 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-25 18:34:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:28,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:34:28,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:34:28,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:28,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:34:28,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856347523] [2022-11-25 18:34:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856347523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:34:28,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:34:28,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:34:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024106616] [2022-11-25 18:34:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:34:28,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:34:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:34:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:34:28,471 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:28,678 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-11-25 18:34:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:34:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-25 18:34:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:28,680 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:34:28,680 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 18:34:28,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-25 18:34:28,682 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:28,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 13 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:34:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 18:34:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-25 18:34:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-25 18:34:28,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-11-25 18:34:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:28,691 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-25 18:34:28,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-25 18:34:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:34:28,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:28,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:28,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2022-11-25 18:34:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:28,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542374681] [2022-11-25 18:34:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:34:28,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-25 18:34:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:28,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:28,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:34:29,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:34:29,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:29,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:34:29,250 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 18:34:29,396 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 40 treesize of output 28 [2022-11-25 18:34:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:29,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:34:29,873 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 18 treesize of output 16 [2022-11-25 18:34:29,880 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 28 treesize of output 26 [2022-11-25 18:34:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:29,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:29,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542374681] [2022-11-25 18:34:29,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542374681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:34:29,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:34:29,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-25 18:34:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373337303] [2022-11-25 18:34:29,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:34:29,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:34:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:34:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:34:29,973 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:32,692 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-25 18:34:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:33,327 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-11-25 18:34:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:34:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) Word has length 17 [2022-11-25 18:34:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:33,330 INFO L225 Difference]: With dead ends: 68 [2022-11-25 18:34:33,330 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 18:34:33,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:34:33,332 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:33,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 157 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 18:34:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 18:34:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 29. [2022-11-25 18:34:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 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-25 18:34:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-25 18:34:33,350 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2022-11-25 18:34:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:33,350 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-25 18:34:33,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-25 18:34:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:34:33,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:33,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:33,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 18:34:33,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:33,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash -596215012, now seen corresponding path program 1 times [2022-11-25 18:34:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:33,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862731743] [2022-11-25 18:34:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:34:33,571 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-25 18:34:33,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:33,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:33,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:34:33,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:34:33,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:33,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:34:34,170 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-25 18:34:34,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:34,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862731743] [2022-11-25 18:34:34,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862731743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:34:34,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:34:34,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-25 18:34:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390590506] [2022-11-25 18:34:34,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:34:34,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:34:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:34:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:34:34,173 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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-25 18:34:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:36,608 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2022-11-25 18:34:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:34:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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 20 [2022-11-25 18:34:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:36,613 INFO L225 Difference]: With dead ends: 101 [2022-11-25 18:34:36,614 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:34:36,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 18:34:36,615 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 231 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:36,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 55 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:34:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:34:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-11-25 18:34:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-11-25 18:34:36,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 20 [2022-11-25 18:34:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:36,640 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-11-25 18:34:36,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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-25 18:34:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-11-25 18:34:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:34:36,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:36,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:36,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:36,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:36,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1344001096, now seen corresponding path program 2 times [2022-11-25 18:34:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:36,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729278110] [2022-11-25 18:34:36,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:34:36,868 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-25 18:34:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:36,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:36,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:36,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:34:36,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:34:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:34:36,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:34:37,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:34:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:38,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729278110] [2022-11-25 18:34:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729278110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:34:38,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:34:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-11-25 18:34:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000717763] [2022-11-25 18:34:38,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:34:38,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 18:34:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:38,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 18:34:38,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:34:38,060 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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-25 18:34:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:42,792 INFO L93 Difference]: Finished difference Result 207 states and 250 transitions. [2022-11-25 18:34:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 18:34:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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) Word has length 25 [2022-11-25 18:34:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:42,795 INFO L225 Difference]: With dead ends: 207 [2022-11-25 18:34:42,796 INFO L226 Difference]: Without dead ends: 173 [2022-11-25 18:34:42,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=830, Invalid=2362, Unknown=0, NotChecked=0, Total=3192 [2022-11-25 18:34:42,798 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 497 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:42,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 125 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:34:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-25 18:34:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 87. [2022-11-25 18:34:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:34:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-11-25 18:34:42,829 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 25 [2022-11-25 18:34:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:42,830 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-11-25 18:34:42,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 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-25 18:34:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-11-25 18:34:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:34:42,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:42,832 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] [2022-11-25 18:34:42,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:43,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:43,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2022-11-25 18:34:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:43,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335238637] [2022-11-25 18:34:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:34:43,046 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-25 18:34:43,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:43,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:43,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:34:43,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 18:34:43,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:43,207 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-25 18:34:43,349 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:34:43,349 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-25 18:34:43,481 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 18:34:43,747 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 46 treesize of output 28 [2022-11-25 18:34:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:43,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:34:44,510 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 20 [2022-11-25 18:34:44,515 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 32 treesize of output 28 [2022-11-25 18:34:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:44,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:44,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335238637] [2022-11-25 18:34:44,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335238637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:34:44,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:34:44,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2022-11-25 18:34:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538950009] [2022-11-25 18:34:44,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:34:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:34:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:34:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:34:44,729 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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-25 18:34:52,083 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-25 18:34:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:34:53,203 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2022-11-25 18:34:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:34:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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 26 [2022-11-25 18:34:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:34:53,205 INFO L225 Difference]: With dead ends: 151 [2022-11-25 18:34:53,205 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 18:34:53,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=439, Invalid=1913, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 18:34:53,208 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 294 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:34:53,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 163 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 398 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-11-25 18:34:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 18:34:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2022-11-25 18:34:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 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-25 18:34:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-11-25 18:34:53,230 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 26 [2022-11-25 18:34:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:34:53,231 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-11-25 18:34:53,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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-25 18:34:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-11-25 18:34:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:34:53,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:34:53,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:34:53,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:53,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:53,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:34:53,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:34:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 3 times [2022-11-25 18:34:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:34:53,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335226617] [2022-11-25 18:34:53,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:34:53,448 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-25 18:34:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:34:53,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:53,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:34:53,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:34:53,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:34:53,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:34:53,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:34:53,633 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-25 18:34:53,714 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 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 18:34:53,765 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:34:53,848 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-11-25 18:34:53,980 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 18:34:53,980 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 23 treesize of output 22 [2022-11-25 18:34:54,052 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:34:54,183 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 40 treesize of output 28 [2022-11-25 18:34:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:54,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:34:55,463 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 36 treesize of output 34 [2022-11-25 18:34:55,468 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 192 treesize of output 190 [2022-11-25 18:34:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:34:56,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:34:56,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335226617] [2022-11-25 18:34:56,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335226617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:34:56,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:34:56,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2022-11-25 18:34:56,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820927767] [2022-11-25 18:34:56,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:34:56,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:34:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:34:56,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:34:56,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:34:56,010 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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-25 18:35:01,305 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-25 18:35:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:03,778 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-11-25 18:35:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:35:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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-25 18:35:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:03,780 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:35:03,780 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 18:35:03,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=475, Invalid=2177, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 18:35:03,782 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 384 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 99 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:03,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 187 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:35:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 18:35:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 78. [2022-11-25 18:35:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.155844155844156) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:35:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-11-25 18:35:03,816 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2022-11-25 18:35:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:03,817 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-11-25 18:35:03,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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-25 18:35:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-11-25 18:35:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:35:03,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:03,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:03,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:04,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:04,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1857271344, now seen corresponding path program 1 times [2022-11-25 18:35:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:35:04,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714445706] [2022-11-25 18:35:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:04,037 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-25 18:35:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:35:04,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:04,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:04,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:35:04,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:04,215 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-25 18:35:04,300 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 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:35:04,436 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:35:04,437 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-25 18:35:04,492 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-11-25 18:35:04,607 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 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:35:04,861 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 46 treesize of output 28 [2022-11-25 18:35:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:04,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:06,046 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 30 treesize of output 28 [2022-11-25 18:35:06,051 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 78 treesize of output 74 [2022-11-25 18:35:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:06,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:35:06,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714445706] [2022-11-25 18:35:06,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714445706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:06,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:35:06,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2022-11-25 18:35:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610243453] [2022-11-25 18:35:06,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:06,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 18:35:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:35:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 18:35:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-11-25 18:35:06,518 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 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-25 18:35:09,584 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-25 18:35:19,747 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 63 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:35:27,980 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-25 18:35:30,020 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-25 18:35:33,241 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 [1] [2022-11-25 18:35:35,259 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 [1] [2022-11-25 18:35:37,262 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 [1] [2022-11-25 18:35:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:41,618 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-25 18:35:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:35:41,618 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 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) Word has length 31 [2022-11-25 18:35:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:41,620 INFO L225 Difference]: With dead ends: 125 [2022-11-25 18:35:41,620 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:35:41,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=490, Invalid=2368, Unknown=4, NotChecked=0, Total=2862 [2022-11-25 18:35:41,622 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 355 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 118 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:41,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 227 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 508 Invalid, 6 Unknown, 0 Unchecked, 13.8s Time] [2022-11-25 18:35:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:35:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 77. [2022-11-25 18:35:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:35:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2022-11-25 18:35:41,657 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 31 [2022-11-25 18:35:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:41,657 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2022-11-25 18:35:41,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 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-25 18:35:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-11-25 18:35:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 18:35:41,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:41,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:41,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:41,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:41,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash -310699674, now seen corresponding path program 2 times [2022-11-25 18:35:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:35:41,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754987052] [2022-11-25 18:35:41,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:35:41,886 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-25 18:35:41,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:35:41,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:41,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:35:42,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:35:42,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:42,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 18:35:42,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:42,067 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-25 18:35:42,140 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 18:35:42,140 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 23 treesize of output 22 [2022-11-25 18:35:42,182 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:35:42,356 INFO L321 Elim1Store]: treesize reduction 70, result has 15.7 percent of original size [2022-11-25 18:35:42,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 32 [2022-11-25 18:35:42,529 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 18:35:42,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:35:42,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:35:42,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:35:43,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:35:43,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2022-11-25 18:35:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:43,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:45,158 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 38 treesize of output 36 [2022-11-25 18:35:45,162 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 322 treesize of output 314 [2022-11-25 18:35:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:35:45,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:35:45,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754987052] [2022-11-25 18:35:45,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754987052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:45,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:35:45,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2022-11-25 18:35:45,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558777002] [2022-11-25 18:35:45,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:45,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 18:35:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:35:45,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 18:35:45,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 18:35:45,784 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:35:53,937 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-25 18:35:56,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:35:58,980 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-25 18:36:25,539 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:36:32,199 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 51 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:36:34,258 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 [1] [2022-11-25 18:36:36,261 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 [1] [2022-11-25 18:36:38,327 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 [1] [2022-11-25 18:36:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:42,254 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-11-25 18:36:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-25 18:36:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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 35 [2022-11-25 18:36:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:42,256 INFO L225 Difference]: With dead ends: 170 [2022-11-25 18:36:42,256 INFO L226 Difference]: Without dead ends: 168 [2022-11-25 18:36:42,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=1006, Invalid=5467, Unknown=7, NotChecked=0, Total=6480 [2022-11-25 18:36:42,258 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 560 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 156 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:42,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 342 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 858 Invalid, 5 Unknown, 0 Unchecked, 15.0s Time] [2022-11-25 18:36:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-25 18:36:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 81. [2022-11-25 18:36:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.15) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-11-25 18:36:42,287 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 35 [2022-11-25 18:36:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:42,287 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-11-25 18:36:42,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-11-25 18:36:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:36:42,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:42,289 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:42,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:42,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:42,501 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:36:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 651293084, now seen corresponding path program 3 times [2022-11-25 18:36:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:36:42,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132275879] [2022-11-25 18:36:42,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:36:42,502 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-25 18:36:42,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:36:42,503 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:42,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:42,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:36:42,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:36:42,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:36:42,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:36:43,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:36:43,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:36:43,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132275879] [2022-11-25 18:36:43,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132275879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:43,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:36:43,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-11-25 18:36:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271750149] [2022-11-25 18:36:43,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:36:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:36:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:36:43,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:36:43,736 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-25 18:36:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:46,186 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-11-25 18:36:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:36:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) Word has length 39 [2022-11-25 18:36:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:46,188 INFO L225 Difference]: With dead ends: 173 [2022-11-25 18:36:46,188 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 18:36:46,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=491, Invalid=1671, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 18:36:46,190 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 249 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:46,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 142 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:36:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 18:36:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2022-11-25 18:36:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-11-25 18:36:46,215 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 39 [2022-11-25 18:36:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:46,216 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-11-25 18:36:46,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-25 18:36:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-11-25 18:36:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:36:46,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:46,217 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:46,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:46,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:46,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:36:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1098739908, now seen corresponding path program 4 times [2022-11-25 18:36:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:36:46,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204742451] [2022-11-25 18:36:46,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:36:46,424 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-25 18:36:46,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:36:46,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:46,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:46,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:36:46,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:36:46,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:36:46,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 18:36:46,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 18:36:47,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:36:47,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204742451] [2022-11-25 18:36:47,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204742451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:47,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:36:47,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2022-11-25 18:36:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115106027] [2022-11-25 18:36:47,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:47,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:36:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:36:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:36:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:36:47,649 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:51,159 INFO L93 Difference]: Finished difference Result 262 states and 283 transitions. [2022-11-25 18:36:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 18:36:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 18:36:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:51,160 INFO L225 Difference]: With dead ends: 262 [2022-11-25 18:36:51,161 INFO L226 Difference]: Without dead ends: 218 [2022-11-25 18:36:51,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=542, Invalid=1620, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 18:36:51,162 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 663 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:51,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 240 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:36:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-25 18:36:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 111. [2022-11-25 18:36:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 110 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-11-25 18:36:51,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 41 [2022-11-25 18:36:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:51,203 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-11-25 18:36:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-11-25 18:36:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 18:36:51,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:51,203 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:51,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:51,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:51,404 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:36:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash -651171970, now seen corresponding path program 5 times [2022-11-25 18:36:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:36:51,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322056949] [2022-11-25 18:36:51,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:36:51,405 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-25 18:36:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:36:51,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:51,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:36:51,590 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-25 18:36:51,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:36:51,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:36:51,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 32 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:36:52,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:54,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:36:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322056949] [2022-11-25 18:36:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322056949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:54,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:36:54,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2022-11-25 18:36:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837467544] [2022-11-25 18:36:54,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:54,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 18:36:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:36:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 18:36:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1156, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 18:36:54,513 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 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-25 18:37:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:37:08,415 INFO L93 Difference]: Finished difference Result 293 states and 311 transitions. [2022-11-25 18:37:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-25 18:37:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 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) Word has length 43 [2022-11-25 18:37:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:37:08,417 INFO L225 Difference]: With dead ends: 293 [2022-11-25 18:37:08,417 INFO L226 Difference]: Without dead ends: 263 [2022-11-25 18:37:08,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4264 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2402, Invalid=11878, Unknown=0, NotChecked=0, Total=14280 [2022-11-25 18:37:08,423 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1616 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:37:08,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 513 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 18:37:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-25 18:37:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 146. [2022-11-25 18:37:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.096551724137931) internal successors, (159), 145 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:37:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2022-11-25 18:37:08,462 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 43 [2022-11-25 18:37:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:37:08,462 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2022-11-25 18:37:08,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 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-25 18:37:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-11-25 18:37:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 18:37:08,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:37:08,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:37:08,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:37:08,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:37:08,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:37:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -249765768, now seen corresponding path program 2 times [2022-11-25 18:37:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:37:08,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219253072] [2022-11-25 18:37:08,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:37:08,670 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-25 18:37:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:37:08,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:37:08,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0f40e46-3f5e-47af-82d9-ae0f41902350/bin/uautomizer-ZsLfNo2U6R/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-25 18:37:08,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:37:08,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:37:08,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 18:37:08,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:37:08,880 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-25 18:37:08,960 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 18:37:08,960 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 23 treesize of output 22 [2022-11-25 18:37:09,021 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 18:37:09,022 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 23 treesize of output 22 [2022-11-25 18:37:09,070 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:37:09,238 INFO L321 Elim1Store]: treesize reduction 70, result has 15.7 percent of original size [2022-11-25 18:37:09,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 32 [2022-11-25 18:37:09,427 INFO L321 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-11-25 18:37:09,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-11-25 18:37:09,575 INFO L321 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-11-25 18:37:09,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-11-25 18:37:09,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:37:09,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:37:10,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:37:10,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2022-11-25 18:37:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:37:10,328 INFO L328 TraceCheckSpWp]: Computing backward predicates...