./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:13:01,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:13:01,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:13:01,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:13:01,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:13:01,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:13:01,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:13:01,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:13:01,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:13:01,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:13:01,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:13:01,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:13:01,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:13:01,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:13:01,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:13:01,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:13:01,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:13:01,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:13:01,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:13:01,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:13:01,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:13:01,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:13:01,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:13:01,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:13:01,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:13:01,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:13:01,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:13:01,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:13:01,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:13:01,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:13:01,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:13:01,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:13:01,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:13:01,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:13:01,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:13:01,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:13:01,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:13:01,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:13:01,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:13:01,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:13:01,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:13:01,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:13:01,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:13:01,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:13:01,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:13:01,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:13:01,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:13:01,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:13:01,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:13:01,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:13:01,413 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:13:01,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:13:01,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:13:01,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:13:01,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:13:01,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:13:01,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:13:01,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:13:01,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:13:01,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:13:01,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:13:01,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:13:01,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:13:01,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:13:01,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:13:01,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:13:01,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:13:01,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:13:01,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:13:01,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:13:01,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:13:01,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:13:01,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:13:01,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:13:01,420 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:13:01,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:13:01,420 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2022-11-25 18:13:01,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:13:01,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:13:01,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:13:01,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:13:01,742 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:13:01,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2022-11-25 18:13:05,159 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:13:05,466 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:13:05,467 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2022-11-25 18:13:05,480 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/data/fe7c1e841/6e38cda80e614e85b609893bcad0a675/FLAG8fec3fcb9 [2022-11-25 18:13:05,497 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/data/fe7c1e841/6e38cda80e614e85b609893bcad0a675 [2022-11-25 18:13:05,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:13:05,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:13:05,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:13:05,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:13:05,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:13:05,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:13:05" (1/1) ... [2022-11-25 18:13:05,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15546c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:05, skipping insertion in model container [2022-11-25 18:13:05,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:13:05" (1/1) ... [2022-11-25 18:13:05,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:13:05,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:13:05,980 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2022-11-25 18:13:05,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:13:05,996 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:13:06,043 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2022-11-25 18:13:06,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:13:06,075 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:13:06,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06 WrapperNode [2022-11-25 18:13:06,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:13:06,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:13:06,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:13:06,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:13:06,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,130 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2022-11-25 18:13:06,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:13:06,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:13:06,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:13:06,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:13:06,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:13:06,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:13:06,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:13:06,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:13:06,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (1/1) ... [2022-11-25 18:13:06,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:13:06,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:06,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:13:06,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:13:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-25 18:13:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-25 18:13:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:13:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:13:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:13:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:13:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:13:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:13:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:13:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:13:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:13:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:13:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:13:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:13:06,465 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:13:06,467 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:13:06,567 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-25 18:13:06,897 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:13:06,904 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:13:06,904 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:13:06,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:13:06 BoogieIcfgContainer [2022-11-25 18:13:06,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:13:06,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:13:06,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:13:06,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:13:06,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:13:05" (1/3) ... [2022-11-25 18:13:06,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cfbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:13:06, skipping insertion in model container [2022-11-25 18:13:06,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:13:06" (2/3) ... [2022-11-25 18:13:06,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cfbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:13:06, skipping insertion in model container [2022-11-25 18:13:06,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:13:06" (3/3) ... [2022-11-25 18:13:06,917 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2022-11-25 18:13:06,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:13:06,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:13:07,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:13:07,012 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;@426fadc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:13:07,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:13:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:13:07,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:07,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:07,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash -670387442, now seen corresponding path program 1 times [2022-11-25 18:13:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:07,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410442375] [2022-11-25 18:13:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410442375] [2022-11-25 18:13:07,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410442375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:07,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:07,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:13:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693119889] [2022-11-25 18:13:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:07,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:13:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:13:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:13:07,416 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:07,448 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-11-25 18:13:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:13:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:13:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:07,461 INFO L225 Difference]: With dead ends: 52 [2022-11-25 18:13:07,461 INFO L226 Difference]: Without dead ends: 21 [2022-11-25 18:13:07,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:13:07,469 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:07,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:13:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-25 18:13:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 18:13:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-25 18:13:07,506 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2022-11-25 18:13:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:07,507 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-25 18:13:07,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-25 18:13:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:13:07,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:07,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:07,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:13:07,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash -888049989, now seen corresponding path program 1 times [2022-11-25 18:13:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:07,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719410903] [2022-11-25 18:13:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719410903] [2022-11-25 18:13:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719410903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:07,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:13:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855942774] [2022-11-25 18:13:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:07,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:13:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:13:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:13:07,696 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:07,713 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-11-25 18:13:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:13:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:13:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:07,715 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:13:07,715 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 18:13:07,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:13:07,717 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:07,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:13:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 18:13:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-11-25 18:13:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-25 18:13:07,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-11-25 18:13:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:07,724 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-25 18:13:07,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-11-25 18:13:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:13:07,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:07,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:13:07,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash -116753941, now seen corresponding path program 1 times [2022-11-25 18:13:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:07,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489456433] [2022-11-25 18:13:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:07,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489456433] [2022-11-25 18:13:07,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489456433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:07,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:07,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:13:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405984695] [2022-11-25 18:13:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:07,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:13:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:13:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:13:07,852 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:07,881 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-25 18:13:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:13:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:13:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:07,883 INFO L225 Difference]: With dead ends: 45 [2022-11-25 18:13:07,883 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 18:13:07,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:13:07,885 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 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-25 18:13:07,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:13:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 18:13:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-25 18:13:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-25 18:13:07,893 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2022-11-25 18:13:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:07,893 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-25 18:13:07,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-25 18:13:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:13:07,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:07,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:07,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:13:07,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -703559955, now seen corresponding path program 1 times [2022-11-25 18:13:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:07,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537622027] [2022-11-25 18:13:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:07,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:08,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537622027] [2022-11-25 18:13:08,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537622027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:08,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375796912] [2022-11-25 18:13:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:08,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:13:08,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:13:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:13:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:08,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:08,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375796912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:13:08,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:13:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 18:13:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836930423] [2022-11-25 18:13:08,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:13:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:13:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:13:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:13:08,516 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:08,557 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-25 18:13:08,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:13:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:13:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:08,561 INFO L225 Difference]: With dead ends: 41 [2022-11-25 18:13:08,562 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 18:13:08,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:13:08,568 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:08,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:13:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 18:13:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 18:13:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-11-25 18:13:08,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2022-11-25 18:13:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:08,583 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-11-25 18:13:08,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-11-25 18:13:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:13:08,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:08,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:08,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 18:13:08,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:08,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1057796345, now seen corresponding path program 1 times [2022-11-25 18:13:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:08,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604184101] [2022-11-25 18:13:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:13:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604184101] [2022-11-25 18:13:10,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604184101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:10,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:10,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:13:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363211899] [2022-11-25 18:13:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:10,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:13:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:13:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:13:10,164 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:10,645 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-25 18:13:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:13:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 18:13:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:10,647 INFO L225 Difference]: With dead ends: 30 [2022-11-25 18:13:10,647 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 18:13:10,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:13:10,648 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:10,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 46 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:13:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 18:13:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-25 18:13:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 18:13:10,656 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-25 18:13:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:10,656 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 18:13:10,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 18:13:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:13:10,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:10,657 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-25 18:13:10,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:13:10,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1364928246, now seen corresponding path program 1 times [2022-11-25 18:13:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198930707] [2022-11-25 18:13:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:13:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:11,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198930707] [2022-11-25 18:13:11,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198930707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:11,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:11,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:13:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41348564] [2022-11-25 18:13:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:13:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:13:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:13:11,988 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:12,789 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-11-25 18:13:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:13:12,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 18:13:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:12,792 INFO L225 Difference]: With dead ends: 51 [2022-11-25 18:13:12,792 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 18:13:12,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:13:12,793 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:12,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 54 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:13:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 18:13:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-11-25 18:13:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-25 18:13:12,802 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2022-11-25 18:13:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:12,803 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 18:13:12,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-25 18:13:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:13:12,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:12,804 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-25 18:13:12,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:13:12,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1364926572, now seen corresponding path program 1 times [2022-11-25 18:13:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:12,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279465182] [2022-11-25 18:13:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:14,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279465182] [2022-11-25 18:13:14,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279465182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:14,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270949907] [2022-11-25 18:13:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:14,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:14,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:13:14,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32844de4-61c1-44a7-a697-8ee23a049eb7/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:13:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:14,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 18:13:14,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:14,863 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-25 18:13:14,951 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:13:14,952 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-25 18:13:15,238 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:13:15,239 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-25 18:13:15,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:15,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:15,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-25 18:13:15,530 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-25 18:13:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:15,894 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:13:15,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 18:13:16,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,054 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-25 18:13:16,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 18:13:16,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:13:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-25 18:13:16,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:13:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:13:16,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,391 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-25 18:13:16,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 86 [2022-11-25 18:13:16,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:16,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-25 18:13:16,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-25 18:13:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-25 18:13:16,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 39 [2022-11-25 18:13:16,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:13:16,807 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-25 18:13:16,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2022-11-25 18:13:16,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:16,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-25 18:13:16,890 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-25 18:13:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:16,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:17,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-25 18:13:19,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-25 18:13:19,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_553 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-25 18:13:19,680 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 31382 treesize of output 29732 [2022-11-25 18:13:20,349 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 1971414 treesize of output 1912500 [2022-11-25 18:13:25,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:25,445 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 2136836 treesize of output 2017656 [2022-11-25 18:13:32,036 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 2259960 treesize of output 2135592 [2022-11-25 18:13:36,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:36,672 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 2409646 treesize of output 2299542 [2022-11-25 18:13:46,097 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 2694056 treesize of output 2617256 [2022-11-25 18:13:51,451 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 3265224 treesize of output 3188200 [2022-11-25 18:13:58,097 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 4175 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:13:58,623 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 3741128 treesize of output 3620168 [2022-11-25 18:14:06,834 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4154 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:15:03,114 WARN L233 SmtUtils]: Spent 47.29s on a formula simplification. DAG size of input: 4142 DAG size of output: 4142 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:15:20,440 WARN L233 SmtUtils]: Spent 12.63s on a formula simplification. DAG size of input: 1439 DAG size of output: 1439 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:15:30,272 WARN L233 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 1437 DAG size of output: 1437 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:16:43,004 WARN L233 SmtUtils]: Spent 22.83s on a formula simplification. DAG size of input: 1437 DAG size of output: 1437 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:16:56,204 WARN L233 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 1435 DAG size of output: 1435 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:19,797 WARN L233 SmtUtils]: Spent 16.46s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:33,766 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:48,070 WARN L233 SmtUtils]: Spent 12.60s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:01,505 WARN L233 SmtUtils]: Spent 11.82s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:11,550 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:20,920 WARN L233 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 1434 DAG size of output: 1434 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:31,936 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 1430 DAG size of output: 1430 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:38,909 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 1183 DAG size of output: 1183 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:18:45,792 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 1174 DAG size of output: 1174 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)