./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:29:43,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:29:43,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:29:43,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:29:43,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:29:43,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:29:43,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:29:43,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:29:43,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:29:43,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:29:43,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:29:43,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:29:43,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:29:43,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:29:43,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:29:43,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:29:43,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:29:43,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:29:43,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:29:43,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:29:43,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:29:43,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:29:43,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:29:43,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:29:43,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:29:43,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:29:43,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:29:43,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:29:43,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:29:43,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:29:43,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:29:43,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:29:43,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:29:43,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:29:43,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:29:43,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:29:43,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:29:43,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:29:43,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:29:43,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:29:43,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:29:43,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:29:43,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:29:43,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:29:43,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:29:43,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:29:43,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:29:43,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:29:43,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:29:43,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:29:43,939 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:29:43,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:29:43,940 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:29:43,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:29:43,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:29:43,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:29:43,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:29:43,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:29:43,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:29:43,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:29:43,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:29:43,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:29:43,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:29:43,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:29:43,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:29:43,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:29:43,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:29:43,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:29:43,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:29:43,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:29:43,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:29:43,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:29:43,946 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:29:43,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:29:43,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:29:43,947 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_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-11-16 11:29:44,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:29:44,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:29:44,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:29:44,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:29:44,220 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:29:44,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-16 11:29:44,302 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/data/2ab80eee4/60a3fa763bfc453da32bda592de70644/FLAGbc78065a6 [2022-11-16 11:29:44,832 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:29:44,833 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-16 11:29:44,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/data/2ab80eee4/60a3fa763bfc453da32bda592de70644/FLAGbc78065a6 [2022-11-16 11:29:45,311 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/data/2ab80eee4/60a3fa763bfc453da32bda592de70644 [2022-11-16 11:29:45,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:29:45,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:29:45,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:29:45,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:29:45,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:29:45,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49daae10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45, skipping insertion in model container [2022-11-16 11:29:45,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:29:45,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:29:45,707 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-16 11:29:45,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:29:45,733 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:29:45,780 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-16 11:29:45,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:29:45,814 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:29:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45 WrapperNode [2022-11-16 11:29:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:29:45,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:29:45,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:29:45,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:29:45,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,877 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-11-16 11:29:45,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:29:45,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:29:45,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:29:45,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:29:45,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:29:45,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:29:45,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:29:45,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:29:45,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (1/1) ... [2022-11-16 11:29:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:29:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:46,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:46,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:29:46,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:29:46,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:29:46,054 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:29:46,054 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:29:46,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:29:46,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:29:46,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:29:46,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:29:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:29:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:29:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:29:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:29:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:29:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:29:46,215 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:29:46,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:29:46,539 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:29:46,545 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:29:46,546 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:29:46,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:29:46 BoogieIcfgContainer [2022-11-16 11:29:46,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:29:46,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:29:46,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:29:46,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:29:46,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:29:45" (1/3) ... [2022-11-16 11:29:46,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:29:46, skipping insertion in model container [2022-11-16 11:29:46,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:29:45" (2/3) ... [2022-11-16 11:29:46,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:29:46, skipping insertion in model container [2022-11-16 11:29:46,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:29:46" (3/3) ... [2022-11-16 11:29:46,566 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-11-16 11:29:46,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:29:46,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:29:46,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:29:46,674 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;@381fd75e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:29:46,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:29:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:29:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:29:46,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:46,690 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, 1] [2022-11-16 11:29:46,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2022-11-16 11:29:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:46,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774563691] [2022-11-16 11:29:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:29:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:47,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774563691] [2022-11-16 11:29:47,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774563691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:47,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:47,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:29:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475752447] [2022-11-16 11:29:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:47,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:29:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:29:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:29:47,144 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:29:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:47,254 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-11-16 11:29:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:29:47,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-16 11:29:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:47,264 INFO L225 Difference]: With dead ends: 65 [2022-11-16 11:29:47,264 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 11:29:47,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 11:29:47,271 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:47,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:29:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 11:29:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-16 11:29:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:29:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-11-16 11:29:47,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-11-16 11:29:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:47,319 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-11-16 11:29:47,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:29:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-11-16 11:29:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:29:47,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:47,326 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, 1] [2022-11-16 11:29:47,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:29:47,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2022-11-16 11:29:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:47,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271379407] [2022-11-16 11:29:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:29:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271379407] [2022-11-16 11:29:47,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271379407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:47,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:47,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:29:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304619589] [2022-11-16 11:29:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:47,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:29:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:29:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:29:47,718 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:29:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:47,800 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-11-16 11:29:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:29:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-16 11:29:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:47,809 INFO L225 Difference]: With dead ends: 52 [2022-11-16 11:29:47,809 INFO L226 Difference]: Without dead ends: 31 [2022-11-16 11:29:47,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:29:47,815 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:47,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:29:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-16 11:29:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-16 11:29:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:29:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-16 11:29:47,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-11-16 11:29:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:47,828 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-16 11:29:47,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:29:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-16 11:29:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:29:47,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:47,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:47,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:29:47,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2022-11-16 11:29:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:47,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380812921] [2022-11-16 11:29:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:48,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:29:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:29:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:29:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:48,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380812921] [2022-11-16 11:29:48,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380812921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:48,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:48,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:29:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265069196] [2022-11-16 11:29:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:48,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:29:48,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:29:48,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:29:48,121 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:29:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:48,219 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-11-16 11:29:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:29:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-11-16 11:29:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:48,224 INFO L225 Difference]: With dead ends: 47 [2022-11-16 11:29:48,224 INFO L226 Difference]: Without dead ends: 39 [2022-11-16 11:29:48,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:29:48,232 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:48,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:29:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-16 11:29:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-11-16 11:29:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:29:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-16 11:29:48,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2022-11-16 11:29:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:48,253 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-16 11:29:48,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:29:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-16 11:29:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:29:48,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:48,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:48,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:29:48,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2022-11-16 11:29:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:48,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488438633] [2022-11-16 11:29:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:29:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:29:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:29:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488438633] [2022-11-16 11:29:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488438633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167748325] [2022-11-16 11:29:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:51,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:51,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:29:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:52,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 152 conjunts are in the unsatisfiable core [2022-11-16 11:29:52,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:52,158 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-16 11:29:52,226 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 5 treesize of output 3 [2022-11-16 11:29:52,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:29:52,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:29:52,423 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-16 11:29:52,649 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 7 treesize of output 3 [2022-11-16 11:29:52,659 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:29:52,659 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 11 treesize of output 7 [2022-11-16 11:29:52,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:29:52,986 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:29:52,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 11:29:52,999 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 5 treesize of output 3 [2022-11-16 11:29:53,046 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 11:29:53,046 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-16 11:29:53,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:29:53,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:29:53,650 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 37 treesize of output 21 [2022-11-16 11:29:53,662 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:29:53,663 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 16 treesize of output 10 [2022-11-16 11:29:53,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 11:29:54,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,012 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 43 treesize of output 39 [2022-11-16 11:29:54,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,035 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 25 treesize of output 30 [2022-11-16 11:29:54,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,062 INFO L321 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2022-11-16 11:29:54,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:29:54,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,092 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-16 11:29:54,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,706 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 11:29:54,707 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 84 [2022-11-16 11:29:54,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-16 11:29:54,748 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-11-16 11:29:54,770 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 25 treesize of output 30 [2022-11-16 11:29:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:54,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:29:54,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2022-11-16 11:29:54,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:29:55,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:29:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:55,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:55,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-16 11:29:57,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-11-16 11:29:58,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_448))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_450))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_449))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_440) (select (select (store (store .cse2 .cse1 v_ArrVal_432) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (< (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|))))) is different from false [2022-11-16 11:29:58,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167748325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:58,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:29:58,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2022-11-16 11:29:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451061592] [2022-11-16 11:29:58,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:29:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 11:29:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 11:29:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1983, Unknown=37, NotChecked=276, Total=2450 [2022-11-16 11:29:58,097 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:30:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:03,113 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-11-16 11:30:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:30:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-11-16 11:30:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:03,117 INFO L225 Difference]: With dead ends: 48 [2022-11-16 11:30:03,117 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 11:30:03,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=190, Invalid=2332, Unknown=40, NotChecked=300, Total=2862 [2022-11-16 11:30:03,119 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:30:03,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 326 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 382 Invalid, 0 Unknown, 91 Unchecked, 0.5s Time] [2022-11-16 11:30:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 11:30:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-11-16 11:30:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-11-16 11:30:03,130 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 34 [2022-11-16 11:30:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:03,131 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-11-16 11:30:03,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:30:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-11-16 11:30:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:30:03,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:03,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:03,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:03,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2022-11-16 11:30:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301058840] [2022-11-16 11:30:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:30:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301058840] [2022-11-16 11:30:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301058840] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178197046] [2022-11-16 11:30:03,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:30:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:03,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:03,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:30:03,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:30:03,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:30:03,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:30:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:30:03,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:30:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178197046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:30:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-16 11:30:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465137837] [2022-11-16 11:30:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:03,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:30:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:03,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:30:03,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:30:03,906 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:30:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:03,950 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-11-16 11:30:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:30:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-16 11:30:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:03,952 INFO L225 Difference]: With dead ends: 56 [2022-11-16 11:30:03,952 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 11:30:03,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:30:03,954 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:30:03,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:30:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 11:30:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-16 11:30:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-16 11:30:03,972 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2022-11-16 11:30:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:03,974 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-16 11:30:03,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:30:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-11-16 11:30:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:30:03,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:03,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:03,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:04,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2022-11-16 11:30:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238566126] [2022-11-16 11:30:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:30:04,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:04,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238566126] [2022-11-16 11:30:04,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238566126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:04,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384588414] [2022-11-16 11:30:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:04,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:04,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:04,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:04,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:30:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:30:04,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:30:04,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:30:04,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384588414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:04,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:30:04,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-16 11:30:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007991596] [2022-11-16 11:30:04,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:30:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:30:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:30:04,693 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:30:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:04,726 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-11-16 11:30:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:30:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-16 11:30:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:04,731 INFO L225 Difference]: With dead ends: 54 [2022-11-16 11:30:04,731 INFO L226 Difference]: Without dead ends: 43 [2022-11-16 11:30:04,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:30:04,733 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 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-16 11:30:04,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:30:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-16 11:30:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-16 11:30:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-11-16 11:30:04,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 35 [2022-11-16 11:30:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:04,752 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-11-16 11:30:04,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:30:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-11-16 11:30:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:30:04,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:04,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:04,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:04,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:30:04,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2022-11-16 11:30:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765218376] [2022-11-16 11:30:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:30:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765218376] [2022-11-16 11:30:05,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765218376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724826881] [2022-11-16 11:30:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:05,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:05,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:05,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:30:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:05,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:30:05,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:05,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:30:05,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:30:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:30:05,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:30:05,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724826881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:30:05,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:30:05,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-16 11:30:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690304617] [2022-11-16 11:30:05,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:05,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:30:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:30:05,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:30:05,527 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:30:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:05,666 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-11-16 11:30:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:30:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-16 11:30:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:05,669 INFO L225 Difference]: With dead ends: 60 [2022-11-16 11:30:05,669 INFO L226 Difference]: Without dead ends: 51 [2022-11-16 11:30:05,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:30:05,670 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:30:05,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:30:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-16 11:30:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-11-16 11:30:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-11-16 11:30:05,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 36 [2022-11-16 11:30:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:05,688 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-11-16 11:30:05,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:30:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-11-16 11:30:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:30:05,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:05,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:05,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:05,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:30:05,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2022-11-16 11:30:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:05,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105019322] [2022-11-16 11:30:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:30:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:06,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105019322] [2022-11-16 11:30:06,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105019322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58719480] [2022-11-16 11:30:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:06,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:06,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:30:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:06,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 11:30:06,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:06,972 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 17 treesize of output 9 [2022-11-16 11:30:07,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:07,092 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 24 treesize of output 24 [2022-11-16 11:30:07,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 11:30:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:07,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58719480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:07,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:30:07,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-16 11:30:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336963762] [2022-11-16 11:30:07,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:07,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:30:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:30:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=709, Unknown=10, NotChecked=0, Total=812 [2022-11-16 11:30:07,523 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:30:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:07,962 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-11-16 11:30:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:30:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-11-16 11:30:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:07,963 INFO L225 Difference]: With dead ends: 51 [2022-11-16 11:30:07,963 INFO L226 Difference]: Without dead ends: 41 [2022-11-16 11:30:07,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=1039, Unknown=10, NotChecked=0, Total=1190 [2022-11-16 11:30:07,966 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:30:07,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 233 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-11-16 11:30:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-16 11:30:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-16 11:30:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-11-16 11:30:07,980 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2022-11-16 11:30:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:07,984 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-11-16 11:30:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:30:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-11-16 11:30:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:30:07,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:07,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:07,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:08,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:08,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2022-11-16 11:30:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:08,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919205920] [2022-11-16 11:30:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:30:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919205920] [2022-11-16 11:30:09,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919205920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781787516] [2022-11-16 11:30:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:09,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:09,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:30:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:09,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-16 11:30:09,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:09,627 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-16 11:30:09,682 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 5 treesize of output 3 [2022-11-16 11:30:09,798 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:30:09,798 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-16 11:30:09,932 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:30:09,932 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 11 treesize of output 7 [2022-11-16 11:30:10,106 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 11:30:10,107 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-16 11:30:10,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:30:10,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:30:10,360 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:30:10,559 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:30:10,560 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 47 treesize of output 22 [2022-11-16 11:30:10,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 11:30:10,592 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:30:10,592 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 16 treesize of output 10 [2022-11-16 11:30:10,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:10,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:30:10,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:10,882 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:30:10,883 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 49 [2022-11-16 11:30:10,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:10,909 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-16 11:30:10,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:30:11,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:11,350 INFO L321 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2022-11-16 11:30:11,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 123 [2022-11-16 11:30:11,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:11,401 INFO L321 Elim1Store]: treesize reduction 57, result has 24.0 percent of original size [2022-11-16 11:30:11,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 115 [2022-11-16 11:30:11,437 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:30:11,438 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:30:11,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:11,471 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 11:30:11,474 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-11-16 11:30:11,497 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 10 treesize of output 9 [2022-11-16 11:30:11,541 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 10 treesize of output 9 [2022-11-16 11:30:11,570 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 5 treesize of output 3 [2022-11-16 11:30:11,828 INFO L321 Elim1Store]: treesize reduction 43, result has 34.8 percent of original size [2022-11-16 11:30:11,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 126 [2022-11-16 11:30:11,840 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 33 treesize of output 31 [2022-11-16 11:30:12,068 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-16 11:30:12,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-11-16 11:30:12,079 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 33 treesize of output 31 [2022-11-16 11:30:12,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:12,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 110 [2022-11-16 11:30:12,483 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 9 treesize of output 7 [2022-11-16 11:30:12,674 INFO L321 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2022-11-16 11:30:12,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 121 [2022-11-16 11:30:12,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:12,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-16 11:30:12,717 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:30:12,717 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 98 treesize of output 80 [2022-11-16 11:30:13,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:30:13,695 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:30:13,696 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 43 treesize of output 18 [2022-11-16 11:30:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:13,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:13,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-16 11:30:13,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 11:30:14,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| |c_#StackHeapBarrier|)) (not (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1414))) (let ((.cse4 (select .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| (store (select (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|) 0 (select .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1415))) (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|) 0)))) is different from false [2022-11-16 11:30:14,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781787516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:14,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:30:14,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40 [2022-11-16 11:30:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869355245] [2022-11-16 11:30:14,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:14,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:30:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:30:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1518, Unknown=7, NotChecked=240, Total=1892 [2022-11-16 11:30:14,051 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:30:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:15,567 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-11-16 11:30:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:30:15,568 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2022-11-16 11:30:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:30:15,568 INFO L225 Difference]: With dead ends: 68 [2022-11-16 11:30:15,569 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 11:30:15,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=274, Invalid=3037, Unknown=7, NotChecked=342, Total=3660 [2022-11-16 11:30:15,577 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 109 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:30:15,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 338 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 602 Invalid, 0 Unknown, 6 Unchecked, 0.5s Time] [2022-11-16 11:30:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 11:30:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2022-11-16 11:30:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:30:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-16 11:30:15,601 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 37 [2022-11-16 11:30:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:30:15,602 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-16 11:30:15,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:30:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-16 11:30:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 11:30:15,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:30:15,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:15,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:30:15,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 11:30:15,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:30:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2022-11-16 11:30:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:15,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825759828] [2022-11-16 11:30:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:30:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:30:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:30:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:30:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:17,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825759828] [2022-11-16 11:30:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825759828] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745937867] [2022-11-16 11:30:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:17,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:17,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7faecaa0-9c8f-48d0-8932-e11fd90ff787/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:30:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:17,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-16 11:30:17,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:17,827 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-16 11:30:18,266 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:30:18,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:30:18,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:30:18,519 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:30:18,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:30:18,741 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:30:18,742 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 46 treesize of output 21 [2022-11-16 11:30:18,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:30:18,755 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 7 treesize of output 3 [2022-11-16 11:30:18,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:30:19,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,069 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:30:19,070 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-16 11:30:19,099 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:30:19,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:30:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,118 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 14 treesize of output 16 [2022-11-16 11:30:19,599 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:30:19,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 87 [2022-11-16 11:30:19,632 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:30:19,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 117 [2022-11-16 11:30:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,647 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 50 treesize of output 31 [2022-11-16 11:30:19,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 34 [2022-11-16 11:30:19,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,670 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2022-11-16 11:30:19,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2022-11-16 11:30:19,974 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 11:30:19,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 53 [2022-11-16 11:30:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:20,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-16 11:30:20,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:30:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:20,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:20,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 Int) (v_ArrVal_1593 (Array Int Int))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1602)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1598))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1593))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1597))) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 11:30:22,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 Int) (v_ArrVal_1593 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1602)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1598))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1593))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1597))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) is different from false [2022-11-16 11:30:23,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:23,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 298 [2022-11-16 11:30:23,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:23,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2968 treesize of output 2840 [2022-11-16 11:30:23,276 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 3232 treesize of output 2712 [2022-11-16 11:30:24,025 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 2159 treesize of output 1899 [2022-11-16 11:30:33,128 WARN L233 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 415 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 11:30:33,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:33,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 4578 treesize of output 13842