./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- 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-8393723 [2022-11-18 19:50:45,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:50:45,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:50:45,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:50:45,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:50:45,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:50:45,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:50:45,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:50:45,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:50:45,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:50:45,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:50:45,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:50:45,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:50:45,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:50:45,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:50:45,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:50:45,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:50:45,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:50:45,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:50:45,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:50:45,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:50:45,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:50:45,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:50:45,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:50:45,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:50:45,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:50:45,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:50:45,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:50:45,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:50:45,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:50:45,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:50:45,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:50:45,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:50:45,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:50:45,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:50:45,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:50:45,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:50:45,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:50:45,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:50:45,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:50:45,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:50:45,736 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:50:45,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:50:45,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:50:45,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:50:45,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:50:45,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:50:45,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:50:45,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:50:45,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:50:45,767 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:50:45,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:50:45,768 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:50:45,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:50:45,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:50:45,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:50:45,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:50:45,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:50:45,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:50:45,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:50:45,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:50:45,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:50:45,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:50:45,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:50:45,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:50:45,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:50:45,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:50:45,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:50:45,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:50:45,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:50:45,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:50:45,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:50:45,775 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:50:45,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:50:45,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:50:45,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/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_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2022-11-18 19:50:46,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:50:46,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:50:46,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:50:46,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:50:46,155 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:50:46,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-18 19:50:46,236 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/data/06007c279/e4bbaaf801e94ef08dfec4e9a208a01f/FLAGb8c3b1bcf [2022-11-18 19:50:46,971 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:50:46,974 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-18 19:50:46,999 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/data/06007c279/e4bbaaf801e94ef08dfec4e9a208a01f/FLAGb8c3b1bcf [2022-11-18 19:50:47,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/data/06007c279/e4bbaaf801e94ef08dfec4e9a208a01f [2022-11-18 19:50:47,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:50:47,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:50:47,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:50:47,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:50:47,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:50:47,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4755747d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47, skipping insertion in model container [2022-11-18 19:50:47,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:50:47,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:50:47,714 WARN L234 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_aa6341a6-6fcf-4128-bb5b-91706f24df97/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-18 19:50:47,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:50:47,735 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:50:47,799 WARN L234 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_aa6341a6-6fcf-4128-bb5b-91706f24df97/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-18 19:50:47,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:50:47,829 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:50:47,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47 WrapperNode [2022-11-18 19:50:47,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:50:47,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:50:47,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:50:47,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:50:47,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,908 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-18 19:50:47,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:50:47,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:50:47,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:50:47,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:50:47,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,940 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:50:47,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:50:47,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:50:47,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:50:47,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:50:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:47,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:50:47,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:50:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-18 19:50:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-18 19:50:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:50:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:50:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:50:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:50:48,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:50:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:50:48,166 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:50:48,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:50:48,234 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-18 19:50:48,563 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:50:48,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:50:48,585 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 19:50:48,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:48 BoogieIcfgContainer [2022-11-18 19:50:48,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:50:48,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:50:48,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:50:48,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:50:48,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:50:47" (1/3) ... [2022-11-18 19:50:48,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3262cc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:48, skipping insertion in model container [2022-11-18 19:50:48,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47" (2/3) ... [2022-11-18 19:50:48,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3262cc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:48, skipping insertion in model container [2022-11-18 19:50:48,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:48" (3/3) ... [2022-11-18 19:50:48,602 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2022-11-18 19:50:48,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:50:48,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:50:48,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:50:48,685 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;@5db3be0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:50:48,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:50:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:50:48,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:48,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:48,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash 692830707, now seen corresponding path program 1 times [2022-11-18 19:50:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596287615] [2022-11-18 19:50:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:48,952 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-18 19:50:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:48,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596287615] [2022-11-18 19:50:48,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596287615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:48,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:48,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298111374] [2022-11-18 19:50:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:48,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:50:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:50:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:50:49,002 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-18 19:50:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:49,033 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-18 19:50:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:50:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-11-18 19:50:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:49,045 INFO L225 Difference]: With dead ends: 50 [2022-11-18 19:50:49,045 INFO L226 Difference]: Without dead ends: 20 [2022-11-18 19:50:49,049 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-18 19:50:49,056 INFO L413 NwaCegarLoop]: 36 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, 36 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-18 19:50:49,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:50:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-18 19:50:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-18 19:50:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-18 19:50:49,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-11-18 19:50:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:49,099 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-18 19:50:49,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-18 19:50:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-18 19:50:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:50:49,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:49,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:50:49,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1759740954, now seen corresponding path program 1 times [2022-11-18 19:50:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:49,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488073280] [2022-11-18 19:50:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:49,327 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-18 19:50:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488073280] [2022-11-18 19:50:49,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488073280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:49,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:49,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534297875] [2022-11-18 19:50:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:49,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:50:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:50:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:49,332 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 19:50:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:49,351 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-18 19:50:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:50:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-11-18 19:50:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:49,353 INFO L225 Difference]: With dead ends: 38 [2022-11-18 19:50:49,354 INFO L226 Difference]: Without dead ends: 25 [2022-11-18 19:50:49,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:49,356 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:49,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:50:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-18 19:50:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-18 19:50:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-18 19:50:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-18 19:50:49,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-11-18 19:50:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:49,364 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-18 19:50:49,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 19:50:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-18 19:50:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 19:50:49,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:49,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:49,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:50:49,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 675600054, now seen corresponding path program 1 times [2022-11-18 19:50:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321018024] [2022-11-18 19:50:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321018024] [2022-11-18 19:50:49,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321018024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:49,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:49,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933955315] [2022-11-18 19:50:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:50:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:50:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:49,551 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-18 19:50:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:49,576 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-11-18 19:50:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:50:49,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-11-18 19:50:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:49,578 INFO L225 Difference]: With dead ends: 43 [2022-11-18 19:50:49,578 INFO L226 Difference]: Without dead ends: 25 [2022-11-18 19:50:49,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:49,580 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:49,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:50:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-18 19:50:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-18 19:50:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-18 19:50:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-18 19:50:49,586 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2022-11-18 19:50:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:49,587 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-18 19:50:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-18 19:50:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-18 19:50:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 19:50:49,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:49,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:49,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:50:49,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -335517196, now seen corresponding path program 1 times [2022-11-18 19:50:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603695255] [2022-11-18 19:50:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:49,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603695255] [2022-11-18 19:50:49,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603695255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841441364] [2022-11-18 19:50:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:49,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:49,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:49,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:49,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:50:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:50,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:50:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:50,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841441364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:50:50,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:50:50,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-18 19:50:50,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446742983] [2022-11-18 19:50:50,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:50:50,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:50:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:50,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:50:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:50:50,221 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-18 19:50:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:50,257 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-18 19:50:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 19 [2022-11-18 19:50:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:50,261 INFO L225 Difference]: With dead ends: 39 [2022-11-18 19:50:50,261 INFO L226 Difference]: Without dead ends: 26 [2022-11-18 19:50:50,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:50:50,270 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:50,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:50:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-18 19:50:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-18 19:50:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-18 19:50:50,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-11-18 19:50:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:50,277 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-18 19:50:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-18 19:50:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-18 19:50:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:50:50,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:50,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:50,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:50,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1568046744, now seen corresponding path program 1 times [2022-11-18 19:50:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:50,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997798044] [2022-11-18 19:50:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:50:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:51,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997798044] [2022-11-18 19:50:51,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997798044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:51,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:51,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 19:50:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833982996] [2022-11-18 19:50:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:51,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:50:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:50:51,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:50:51,863 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:52,498 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-11-18 19:50:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:50:52,503 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 19:50:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:52,504 INFO L225 Difference]: With dead ends: 34 [2022-11-18 19:50:52,504 INFO L226 Difference]: Without dead ends: 32 [2022-11-18 19:50:52,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-18 19:50:52,506 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 95 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:52,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 38 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:50:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-18 19:50:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-11-18 19:50:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-18 19:50:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-18 19:50:52,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2022-11-18 19:50:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:52,521 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-18 19:50:52,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-18 19:50:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:50:52,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:52,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:50:52,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1568048418, now seen corresponding path program 1 times [2022-11-18 19:50:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:52,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080902925] [2022-11-18 19:50:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:50:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080902925] [2022-11-18 19:50:52,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080902925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:52,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:52,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:50:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546145498] [2022-11-18 19:50:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:52,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:50:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:50:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:50:52,829 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-18 19:50:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:52,960 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-18 19:50:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:50:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 19:50:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:52,964 INFO L225 Difference]: With dead ends: 31 [2022-11-18 19:50:52,965 INFO L226 Difference]: Without dead ends: 28 [2022-11-18 19:50:52,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:50:52,967 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:52,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:50:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-18 19:50:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-18 19:50:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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-18 19:50:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-18 19:50:52,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2022-11-18 19:50:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:52,981 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-18 19:50:52,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-18 19:50:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-18 19:50:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 19:50:52,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:52,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:52,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:50:52,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:50:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 640634787, now seen corresponding path program 1 times [2022-11-18 19:50:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900854980] [2022-11-18 19:50:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:55,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:55,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900854980] [2022-11-18 19:50:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900854980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:55,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427198956] [2022-11-18 19:50:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:55,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:55,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa6341a6-6fcf-4128-bb5b-91706f24df97/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:50:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:55,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-18 19:50:55,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:55,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:50:55,382 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:50:55,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 19:50:55,625 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 19:50:55,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 19:50:55,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:55,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:55,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-18 19:50:55,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:50:56,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,336 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 19:50:56,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-18 19:50:56,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:50:56,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,499 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 34 treesize of output 32 [2022-11-18 19:50:56,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 19:50:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,618 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-18 19:50:56,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-18 19:50:56,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 19:50:56,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,817 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-18 19:50:56,818 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 92 treesize of output 86 [2022-11-18 19:50:56,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:50:56,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-18 19:50:56,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-18 19:50:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-18 19:50:56,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:56,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 39 [2022-11-18 19:50:56,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:50:57,233 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-18 19:50:57,234 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2022-11-18 19:50:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:50:57,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-18 19:50:57,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:50:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:57,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:57,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-18 19:50:59,674 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-18 19:50:59,790 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-18 19:50:59,970 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_551 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-18 19:51:00,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 22616 treesize of output 21352 [2022-11-18 19:51:00,469 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 1703132 treesize of output 1652122 [2022-11-18 19:51:03,818 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 1760662 treesize of output 1690314 [2022-11-18 19:51:07,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:51:07,334 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 1905728 treesize of output 1778040 [2022-11-18 19:51:14,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:51:14,191 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 1951504 treesize of output 1868408 [2022-11-18 19:51:21,155 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 2358234 treesize of output 2298474 [2022-11-18 19:51:25,950 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 2788138 treesize of output 2695322 [2022-11-18 19:51:31,129 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 3337 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 19:51:31,547 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 3135770 treesize of output 3036314 [2022-11-18 19:51:37,655 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 3316 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 19:52:22,771 WARN L233 SmtUtils]: Spent 38.16s on a formula simplification. DAG size of input: 3304 DAG size of output: 3304 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)