./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf89a9db9089e52f60762f5e253ea7c1b22972a3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 04:48:03,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 04:48:03,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 04:48:03,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 04:48:03,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 04:48:03,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 04:48:03,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 04:48:03,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 04:48:03,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 04:48:03,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 04:48:03,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 04:48:03,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 04:48:03,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 04:48:03,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 04:48:03,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 04:48:03,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 04:48:03,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 04:48:03,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 04:48:03,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 04:48:03,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 04:48:03,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 04:48:03,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 04:48:03,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 04:48:03,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 04:48:03,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 04:48:03,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 04:48:03,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 04:48:03,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 04:48:03,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 04:48:03,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 04:48:03,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 04:48:03,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 04:48:03,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 04:48:03,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 04:48:03,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 04:48:03,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 04:48:03,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 04:48:03,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 04:48:03,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 04:48:03,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 04:48:03,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 04:48:03,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 04:48:03,960 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 04:48:03,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 04:48:03,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 04:48:03,961 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 04:48:03,961 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 04:48:03,962 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 04:48:03,962 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 04:48:03,962 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 04:48:03,962 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 04:48:03,962 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 04:48:03,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 04:48:03,963 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 04:48:03,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 04:48:03,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 04:48:03,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 04:48:03,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 04:48:03,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 04:48:03,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 04:48:03,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 04:48:03,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 04:48:03,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 04:48:03,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 04:48:03,965 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 04:48:03,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 04:48:03,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 04:48:03,966 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 04:48:03,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 04:48:03,966 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/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-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan 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 -> Taipan 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 -> bf89a9db9089e52f60762f5e253ea7c1b22972a3 [2020-12-09 04:48:04,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 04:48:04,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 04:48:04,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 04:48:04,182 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 04:48:04,182 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 04:48:04,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2020-12-09 04:48:04,230 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/data/02f6f5b20/81e4b515a9ec4b51b03ba37179a38fa9/FLAG5330b3d4d [2020-12-09 04:48:04,635 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 04:48:04,636 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2020-12-09 04:48:04,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/data/02f6f5b20/81e4b515a9ec4b51b03ba37179a38fa9/FLAG5330b3d4d [2020-12-09 04:48:05,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/data/02f6f5b20/81e4b515a9ec4b51b03ba37179a38fa9 [2020-12-09 04:48:05,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 04:48:05,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 04:48:05,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 04:48:05,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 04:48:05,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 04:48:05,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d397c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05, skipping insertion in model container [2020-12-09 04:48:05,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 04:48:05,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 04:48:05,248 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2020-12-09 04:48:05,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:48:05,256 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 04:48:05,290 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2020-12-09 04:48:05,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:48:05,337 INFO L208 MainTranslator]: Completed translation [2020-12-09 04:48:05,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05 WrapperNode [2020-12-09 04:48:05,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 04:48:05,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 04:48:05,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 04:48:05,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 04:48:05,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 04:48:05,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 04:48:05,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 04:48:05,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 04:48:05,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... [2020-12-09 04:48:05,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 04:48:05,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 04:48:05,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 04:48:05,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 04:48:05,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 04:48:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 04:48:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 04:48:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 04:48:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 04:48:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 04:48:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 04:48:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 04:48:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 04:48:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 04:48:05,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 04:48:05,766 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 04:48:05,767 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-09 04:48:05,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:05 BoogieIcfgContainer [2020-12-09 04:48:05,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 04:48:05,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 04:48:05,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 04:48:05,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 04:48:05,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:48:05" (1/3) ... [2020-12-09 04:48:05,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7573c82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:48:05, skipping insertion in model container [2020-12-09 04:48:05,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:05" (2/3) ... [2020-12-09 04:48:05,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7573c82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:48:05, skipping insertion in model container [2020-12-09 04:48:05,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:05" (3/3) ... [2020-12-09 04:48:05,774 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2020-12-09 04:48:05,783 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 04:48:05,786 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 04:48:05,793 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 04:48:05,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 04:48:05,809 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 04:48:05,809 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 04:48:05,809 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 04:48:05,809 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 04:48:05,810 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 04:48:05,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 04:48:05,810 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 04:48:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-12-09 04:48:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 04:48:05,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:05,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:05,822 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 926181436, now seen corresponding path program 1 times [2020-12-09 04:48:05,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:05,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807490325] [2020-12-09 04:48:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:48:05,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807490325] [2020-12-09 04:48:05,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:48:05,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:48:05,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829907542] [2020-12-09 04:48:05,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:48:05,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:05,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:48:05,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:48:05,985 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-12-09 04:48:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:06,016 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-12-09 04:48:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:48:06,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 04:48:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:06,025 INFO L225 Difference]: With dead ends: 27 [2020-12-09 04:48:06,025 INFO L226 Difference]: Without dead ends: 12 [2020-12-09 04:48:06,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:48:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-12-09 04:48:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-12-09 04:48:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-12-09 04:48:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-12-09 04:48:06,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2020-12-09 04:48:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:06,058 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-12-09 04:48:06,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:48:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-12-09 04:48:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 04:48:06,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:06,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:06,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 04:48:06,059 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1018795863, now seen corresponding path program 1 times [2020-12-09 04:48:06,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:06,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610260700] [2020-12-09 04:48:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:48:06,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610260700] [2020-12-09 04:48:06,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:48:06,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:48:06,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279000163] [2020-12-09 04:48:06,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:48:06,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:06,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:48:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:48:06,130 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 4 states. [2020-12-09 04:48:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:06,159 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-12-09 04:48:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:48:06,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 04:48:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:06,161 INFO L225 Difference]: With dead ends: 23 [2020-12-09 04:48:06,161 INFO L226 Difference]: Without dead ends: 18 [2020-12-09 04:48:06,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:48:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-09 04:48:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2020-12-09 04:48:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-12-09 04:48:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-12-09 04:48:06,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-12-09 04:48:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:06,165 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-12-09 04:48:06,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:48:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-12-09 04:48:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 04:48:06,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:06,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:06,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 04:48:06,166 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -548738254, now seen corresponding path program 1 times [2020-12-09 04:48:06,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:06,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146825169] [2020-12-09 04:48:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:48:06,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146825169] [2020-12-09 04:48:06,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561292122] [2020-12-09 04:48:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:06,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 04:48:06,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:48:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:48:06,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:48:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:48:06,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285568278] [2020-12-09 04:48:06,368 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:48:06,368 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:48:06,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:48:06,376 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:48:06,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:48:06,614 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:07,400 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:07,447 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:07,732 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:08,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:08,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:08,526 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:08,541 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:08,545 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:48:09,216 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 109 [2020-12-09 04:48:09,482 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-12-09 04:48:09,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:48:09,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2020-12-09 04:48:09,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93931726] [2020-12-09 04:48:09,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:48:09,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:48:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:48:09,485 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2020-12-09 04:48:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:09,548 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-12-09 04:48:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:48:09,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 04:48:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:09,549 INFO L225 Difference]: With dead ends: 21 [2020-12-09 04:48:09,549 INFO L226 Difference]: Without dead ends: 14 [2020-12-09 04:48:09,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:48:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-09 04:48:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-12-09 04:48:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-12-09 04:48:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-12-09 04:48:09,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2020-12-09 04:48:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:09,553 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-12-09 04:48:09,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:48:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-12-09 04:48:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 04:48:09,554 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:09,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:09,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 04:48:09,756 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash -228704609, now seen corresponding path program 1 times [2020-12-09 04:48:09,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:09,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72765254] [2020-12-09 04:48:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:48:09,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72765254] [2020-12-09 04:48:09,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814624510] [2020-12-09 04:48:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:09,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 04:48:09,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:48:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:48:09,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:48:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:48:09,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501670098] [2020-12-09 04:48:09,898 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:48:09,898 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:48:09,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:48:09,898 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:48:09,899 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:48:09,988 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:10,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:10,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:10,908 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:11,312 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:11,324 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:11,570 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:11,676 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:11,973 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:48:12,657 WARN L197 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 110 [2020-12-09 04:48:13,057 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-12-09 04:48:13,210 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-09 04:48:13,380 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2020-12-09 04:48:13,589 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2020-12-09 04:48:13,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:48:13,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2020-12-09 04:48:13,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013165565] [2020-12-09 04:48:13,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 04:48:13,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 04:48:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-09 04:48:13,591 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 8 states. [2020-12-09 04:48:13,962 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2020-12-09 04:48:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:14,027 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-12-09 04:48:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 04:48:14,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-12-09 04:48:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:14,027 INFO L225 Difference]: With dead ends: 29 [2020-12-09 04:48:14,027 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 04:48:14,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-09 04:48:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 04:48:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2020-12-09 04:48:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-12-09 04:48:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-12-09 04:48:14,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2020-12-09 04:48:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:14,033 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-12-09 04:48:14,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 04:48:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-12-09 04:48:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 04:48:14,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:14,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:14,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-09 04:48:14,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1498583296, now seen corresponding path program 1 times [2020-12-09 04:48:14,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:14,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380780657] [2020-12-09 04:48:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 04:48:14,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380780657] [2020-12-09 04:48:14,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460961140] [2020-12-09 04:48:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:14,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 04:48:14,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:48:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 04:48:14,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:48:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 04:48:14,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730695002] [2020-12-09 04:48:14,373 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:48:14,373 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:48:14,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:48:14,374 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:48:14,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:48:14,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,510 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,705 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,829 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:14,983 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:15,296 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:48:15,781 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2020-12-09 04:48:15,902 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-09 04:48:16,064 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 04:48:16,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:48:16,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 04:48:16,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114201680] [2020-12-09 04:48:16,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:48:16,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:48:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-09 04:48:16,066 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 5 states. [2020-12-09 04:48:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:16,094 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-12-09 04:48:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 04:48:16,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 04:48:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:16,095 INFO L225 Difference]: With dead ends: 28 [2020-12-09 04:48:16,095 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 04:48:16,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-09 04:48:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 04:48:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 04:48:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 04:48:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 04:48:16,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2020-12-09 04:48:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:16,101 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 04:48:16,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:48:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 04:48:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 04:48:16,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:16,102 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:16,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2020-12-09 04:48:16,303 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1779709011, now seen corresponding path program 2 times [2020-12-09 04:48:16,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:16,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243840804] [2020-12-09 04:48:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 04:48:16,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243840804] [2020-12-09 04:48:16,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922255292] [2020-12-09 04:48:16,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:16,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 04:48:16,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 04:48:16,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 04:48:16,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:48:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 04:48:16,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:48:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 04:48:16,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038131638] [2020-12-09 04:48:16,428 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:48:16,428 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:48:16,429 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:48:16,429 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:48:16,429 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:48:16,522 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:16,932 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:16,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:17,215 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:17,505 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:17,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:17,797 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:17,889 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:18,205 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:48:18,949 WARN L197 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 109 [2020-12-09 04:48:19,338 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-12-09 04:48:19,493 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-09 04:48:19,661 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2020-12-09 04:48:19,869 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-12-09 04:48:20,120 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 04:48:20,121 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 04:48:20,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:48:20,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2020-12-09 04:48:20,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692813669] [2020-12-09 04:48:20,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:48:20,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:48:20,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-09 04:48:20,122 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-12-09 04:48:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:48:20,161 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-12-09 04:48:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:48:20,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 04:48:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:48:20,162 INFO L225 Difference]: With dead ends: 31 [2020-12-09 04:48:20,162 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 04:48:20,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-09 04:48:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 04:48:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-12-09 04:48:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 04:48:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-12-09 04:48:20,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2020-12-09 04:48:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:48:20,168 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-12-09 04:48:20,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:48:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-12-09 04:48:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 04:48:20,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:48:20,168 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:48:20,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:20,370 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:48:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:48:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -872638332, now seen corresponding path program 3 times [2020-12-09 04:48:20,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:48:20,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892703102] [2020-12-09 04:48:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:48:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:48:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:48:20,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892703102] [2020-12-09 04:48:20,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392384821] [2020-12-09 04:48:20,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:48:20,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 04:48:20,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 04:48:20,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 91 conjunts are in the unsatisfiable core [2020-12-09 04:48:20,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:48:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 04:48:21,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:48:43,454 WARN L197 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-09 04:48:45,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_75 Int) (ULTIMATE.start_sll_update_at_~data Int) (v_DerPreprocessor_74 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (<= (+ (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 ULTIMATE.start_sll_update_at_~data)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_75) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_74) .cse0))) 1) (* 2 c_ULTIMATE.start_main_~len~0)))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_prenex_1 Int) (v_DerPreprocessor_76 Int) (v_DerPreprocessor_73 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_1)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse1))) 1))))) is different from false [2020-12-09 04:48:45,778 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2020-12-09 04:48:45,987 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2020-12-09 04:48:48,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int)) (or (and (or (forall ((v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))) (forall ((v_DerPreprocessor_78 Int) (v_DerPreprocessor_76 Int)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ c_ULTIMATE.start_sll_update_at_~data 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_6)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_7) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (forall ((v_prenex_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (and (or (forall ((v_prenex_10 Int) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_main_~s~0.base))) (forall ((v_prenex_11 Int) (v_prenex_8 Int)) (not (= v_prenex_3 (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))) (forall ((v_DerPreprocessor_77 Int) (v_DerPreprocessor_75 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_75) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base)) (<= (+ c_ULTIMATE.start_sll_update_at_~data 1) (* 2 c_ULTIMATE.start_main_~len~0)) (forall ((v_DerPreprocessor_79 Int) (v_DerPreprocessor_74 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_79)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_74) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset)))))) is different from false [2020-12-09 04:48:50,043 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse3 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (forall ((v_DerPreprocessor_79 Int) (v_prenex_3 Int) (v_DerPreprocessor_74 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (let ((.cse2 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse2))) (= (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_DerPreprocessor_79))) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_74) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse1))))) (<= .cse3 .cse4) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse8 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse8)) (.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse8)) (.cse7 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) .cse7) v_prenex_3)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) .cse7))))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse12)) (.cse10 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse12)) (.cse11 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse11))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse11))))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int)) (or (let ((.cse15 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse15))) (= (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse15))) (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_6))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_7) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse14))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (forall ((v_DerPreprocessor_78 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_76 Int)) (or (let ((.cse17 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse17))) (= .cse16 (select (store (select (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse17) v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (<= .cse4 .cse3) (forall ((v_DerPreprocessor_77 Int) (v_prenex_3 Int) (v_DerPreprocessor_75 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (let ((.cse19 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse19))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse19) v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_75) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse18))))))) is different from false [2020-12-09 04:48:52,067 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_ULTIMATE.start_main_~i~0 1))) (and (forall ((v_DerPreprocessor_79 Int) (v_prenex_15 Int) (v_DerPreprocessor_74 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse2))) (= .cse0 (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse0 v_DerPreprocessor_79))) c_ULTIMATE.start_main_~s~0.base) v_prenex_15 v_DerPreprocessor_74) .cse2)))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_15))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse5))) (or (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse5))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse5))))))) (<= c_ULTIMATE.start_main_~len~0 .cse6) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse9)) (.cse8 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) .cse8 v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) .cse9))) (not (= v_prenex_3 (select (store (select (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse8 v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) .cse9))))))) (forall ((v_DerPreprocessor_77 Int) (v_prenex_14 Int) (v_DerPreprocessor_75 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_14) (let ((.cse11 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse11))) (= .cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse11) v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_14 v_DerPreprocessor_75) .cse11)))))) (forall ((v_DerPreprocessor_78 Int) (v_prenex_13 Int) (v_DerPreprocessor_76 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_13) (let ((.cse13 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse13))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse13) v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_prenex_13 v_DerPreprocessor_76) .cse13) .cse12))))) (<= .cse6 c_ULTIMATE.start_main_~len~0) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_12 Int)) (or (let ((.cse16 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse16))) (= .cse14 (select (store (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse16))) (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) .cse14 v_prenex_6))) c_ULTIMATE.start_main_~s~0.base) v_prenex_12 v_prenex_7) .cse16)))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_12))))) is different from false [2020-12-09 04:48:54,089 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_79 Int) (v_prenex_15 Int) (v_DerPreprocessor_74 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse2))) (= (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_DerPreprocessor_79))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_15 v_DerPreprocessor_74) .cse2) .cse1))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_15))) (forall ((v_DerPreprocessor_78 Int) (v_prenex_13 Int) (v_DerPreprocessor_76 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_13) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4) v_DerPreprocessor_78)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_13 v_DerPreprocessor_76) .cse4)))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse7 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (or (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_prenex_4)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse7))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_80)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse7))))))) (forall ((v_DerPreprocessor_77 Int) (v_prenex_14 Int) (v_DerPreprocessor_75 Int)) (or (let ((.cse9 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse9))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse9) v_DerPreprocessor_77)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_14 v_DerPreprocessor_75) .cse9) .cse8))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_14))) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse12))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_3) (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_prenex_9)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_3 v_prenex_10) .cse12))) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_8)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_3 v_prenex_11) .cse12) v_prenex_3)))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_12 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_12) (let ((.cse15 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (= (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_6))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_12 v_prenex_7) .cse15) .cse14)))))) is different from false [2020-12-09 04:48:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 04:48:55,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155736080] [2020-12-09 04:48:55,321 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:48:55,321 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:48:55,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:48:55,321 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:48:55,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:48:55,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:55,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:55,980 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:56,198 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:56,535 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:56,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:56,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:56,951 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:48:57,277 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:48:57,443 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-12-09 04:48:58,286 WARN L197 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2020-12-09 04:48:58,828 WARN L197 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-12-09 04:48:59,049 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-09 04:48:59,304 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2020-12-09 04:48:59,582 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-12-09 04:48:59,904 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 04:48:59,905 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 04:48:59,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:48:59,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31 [2020-12-09 04:48:59,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420210170] [2020-12-09 04:48:59,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-09 04:48:59,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:48:59,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-09 04:48:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1021, Unknown=13, NotChecked=340, Total=1482 [2020-12-09 04:48:59,907 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 31 states. [2020-12-09 04:49:02,064 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)) c_ULTIMATE.start_sll_create_~head~0.base)) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (forall ((v_DerPreprocessor_79 Int) (v_prenex_15 Int) (v_DerPreprocessor_74 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse2))) (= (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_DerPreprocessor_79))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_15 v_DerPreprocessor_74) .cse2) .cse1))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_15))) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (forall ((v_DerPreprocessor_78 Int) (v_prenex_13 Int) (v_DerPreprocessor_76 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_13) (let ((.cse4 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse4))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse4) v_DerPreprocessor_78)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_13 v_DerPreprocessor_76) .cse4)))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse7 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse7))) (or (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_prenex_4)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse7))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_DerPreprocessor_80)) c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse7))))))) (forall ((v_DerPreprocessor_77 Int) (v_prenex_14 Int) (v_DerPreprocessor_75 Int)) (or (let ((.cse9 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse9))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse9) v_DerPreprocessor_77)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_14 v_DerPreprocessor_75) .cse9) .cse8))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_14))) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse12))) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_3) (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_prenex_9)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_3 v_prenex_10) .cse12))) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_prenex_8)) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_3 v_prenex_11) .cse12) v_prenex_3)))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_12 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_12) (let ((.cse15 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (= (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) .cse15))) (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_6))) c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_12 v_prenex_7) .cse15) .cse14)))))) is different from false [2020-12-09 04:49:04,092 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_ULTIMATE.start_main_~i~0 1))) (and (forall ((v_DerPreprocessor_79 Int) (v_prenex_15 Int) (v_DerPreprocessor_74 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse2))) (= .cse0 (select (store (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse0 v_DerPreprocessor_79))) c_ULTIMATE.start_main_~s~0.base) v_prenex_15 v_DerPreprocessor_74) .cse2)))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_15))) (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse5))) (or (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse5))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse5))))))) (<= c_ULTIMATE.start_main_~len~0 .cse6) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse9)) (.cse8 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) .cse8 v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) .cse9))) (not (= v_prenex_3 (select (store (select (store |c_#memory_$Pointer$.offset| .cse7 (store (select |c_#memory_$Pointer$.offset| .cse7) .cse8 v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) .cse9))))))) (forall ((v_DerPreprocessor_77 Int) (v_prenex_14 Int) (v_DerPreprocessor_75 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_14) (let ((.cse11 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse11))) (= .cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse11) v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_14 v_DerPreprocessor_75) .cse11)))))) (forall ((v_DerPreprocessor_78 Int) (v_prenex_13 Int) (v_DerPreprocessor_76 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_13) (let ((.cse13 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse13))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse13) v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_prenex_13 v_DerPreprocessor_76) .cse13) .cse12))))) (<= .cse6 c_ULTIMATE.start_main_~len~0) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_12 Int)) (or (let ((.cse16 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse16))) (= .cse14 (select (store (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse16))) (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) .cse14 v_prenex_6))) c_ULTIMATE.start_main_~s~0.base) v_prenex_12 v_prenex_7) .cse16)))) (< c_ULTIMATE.start_main_~s~0.offset v_prenex_12))))) is different from false [2020-12-09 04:49:06,101 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse3 (+ c_ULTIMATE.start_sll_update_at_~data 1))) (and (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (forall ((v_DerPreprocessor_79 Int) (v_prenex_3 Int) (v_DerPreprocessor_74 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (let ((.cse2 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse2))) (= (select (store (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse2))) (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_DerPreprocessor_79))) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_74) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse1))))) (<= .cse3 .cse4) (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base) (forall ((v_prenex_11 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse8 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse8)) (.cse6 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse8)) (.cse7 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) .cse7) v_prenex_3)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) .cse7))))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (let ((.cse12 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse12)) (.cse10 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse12)) (.cse11 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (or (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) .cse11))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse11))))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int)) (or (let ((.cse15 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse15))) (= (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse15))) (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) .cse14 v_prenex_6))) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_7) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse14))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (forall ((v_DerPreprocessor_78 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_76 Int)) (or (let ((.cse17 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse17))) (= .cse16 (select (store (select (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse17) v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (<= .cse4 .cse3) (forall ((v_DerPreprocessor_77 Int) (v_prenex_3 Int) (v_DerPreprocessor_75 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (let ((.cse19 (+ c_ULTIMATE.start_sll_update_at_~head.offset 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) .cse19))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) .cse19) v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_75) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse18))))) (= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_update_at_~head.offset))) is different from false [2020-12-09 04:49:08,110 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_ULTIMATE.start_main_~len~0)) (.cse1 (+ c_ULTIMATE.start_sll_update_at_~data 1)) (.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (and (= c_ULTIMATE.start_sll_update_at_~head.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse0)) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int)) (or (and (or (forall ((v_DerPreprocessor_80 Int) (v_DerPreprocessor_73 Int)) (not (= v_ULTIMATE.start_sll_update_at_~head.offset_33 (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_80)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) (+ c_ULTIMATE.start_main_~s~0.offset 4))))) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_5) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))) (forall ((v_DerPreprocessor_78 Int) (v_DerPreprocessor_76 Int)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_78)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ c_ULTIMATE.start_sll_update_at_~data 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_6)) c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_7) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33))) (<= .cse1 .cse2) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_update_at_~head.base)) (<= .cse2 .cse1) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse0) c_ULTIMATE.start_sll_update_at_~head.offset) (forall ((v_prenex_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_prenex_3) (and (or (forall ((v_prenex_10 Int) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_9)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_10) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_main_~s~0.base))) (forall ((v_prenex_11 Int) (v_prenex_8 Int)) (not (= v_prenex_3 (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_prenex_8)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_prenex_11) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))) (forall ((v_DerPreprocessor_77 Int) (v_DerPreprocessor_75 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_77)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_75) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.base)) (<= (+ c_ULTIMATE.start_sll_update_at_~data 1) (* 2 c_ULTIMATE.start_main_~len~0)) (forall ((v_DerPreprocessor_79 Int) (v_DerPreprocessor_74 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_79)) c_ULTIMATE.start_main_~s~0.base) v_prenex_3 v_DerPreprocessor_74) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_sll_update_at_~head.offset))))))) is different from false [2020-12-09 04:49:10,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse5))) (let ((.cse2 (+ (select (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse5)) 1)) (.cse1 (* 2 c_ULTIMATE.start_main_~len~0))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (<= .cse1 .cse2) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_75 Int) (ULTIMATE.start_sll_update_at_~data Int) (v_DerPreprocessor_74 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (<= (+ (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 ULTIMATE.start_sll_update_at_~data)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_75) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_74) .cse3))) 1) (* 2 c_ULTIMATE.start_main_~len~0)))) (<= .cse2 .cse1) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_prenex_1 Int) (v_DerPreprocessor_76 Int) (v_DerPreprocessor_73 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (<= (* 2 c_ULTIMATE.start_main_~len~0) (+ (let ((.cse4 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~s~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_prenex_1)) (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_76) .cse4)) (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_73) .cse4))) 1)))))))) is different from false [2020-12-09 04:49:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:10,458 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-12-09 04:49:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 04:49:10,458 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 17 [2020-12-09 04:49:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:10,459 INFO L225 Difference]: With dead ends: 41 [2020-12-09 04:49:10,459 INFO L226 Difference]: Without dead ends: 39 [2020-12-09 04:49:10,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=204, Invalid=1540, Unknown=18, NotChecked=890, Total=2652 [2020-12-09 04:49:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-09 04:49:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2020-12-09 04:49:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 04:49:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-12-09 04:49:10,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2020-12-09 04:49:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:10,469 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-12-09 04:49:10,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-09 04:49:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-12-09 04:49:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 04:49:10,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:10,470 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:10,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable325 [2020-12-09 04:49:10,671 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1283492933, now seen corresponding path program 4 times [2020-12-09 04:49:10,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:10,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099904034] [2020-12-09 04:49:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 04:49:10,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099904034] [2020-12-09 04:49:10,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:49:10,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 04:49:10,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147613101] [2020-12-09 04:49:10,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:49:10,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:49:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:49:10,744 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 6 states. [2020-12-09 04:49:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:10,791 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-12-09 04:49:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:49:10,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 04:49:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:10,793 INFO L225 Difference]: With dead ends: 33 [2020-12-09 04:49:10,793 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 04:49:10,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:49:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 04:49:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-09 04:49:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 04:49:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-09 04:49:10,803 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2020-12-09 04:49:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:10,803 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-09 04:49:10,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:49:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-09 04:49:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 04:49:10,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:10,807 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:10,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2020-12-09 04:49:10,808 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -680155607, now seen corresponding path program 5 times [2020-12-09 04:49:10,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:10,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706486737] [2020-12-09 04:49:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 04:49:10,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706486737] [2020-12-09 04:49:10,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692731785] [2020-12-09 04:49:10,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:10,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-09 04:49:10,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 04:49:10,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 04:49:10,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:49:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 04:49:10,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:49:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 04:49:10,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 04:49:10,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2020-12-09 04:49:10,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840374464] [2020-12-09 04:49:10,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:49:10,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:10,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:49:10,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-09 04:49:10,999 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 5 states. [2020-12-09 04:49:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:11,035 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-09 04:49:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:49:11,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-09 04:49:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:11,036 INFO L225 Difference]: With dead ends: 42 [2020-12-09 04:49:11,036 INFO L226 Difference]: Without dead ends: 34 [2020-12-09 04:49:11,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-09 04:49:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-09 04:49:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2020-12-09 04:49:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 04:49:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-09 04:49:11,045 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2020-12-09 04:49:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:11,046 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-09 04:49:11,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:49:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-09 04:49:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 04:49:11,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:11,046 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:11,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:11,248 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash 627856439, now seen corresponding path program 6 times [2020-12-09 04:49:11,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:11,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713194334] [2020-12-09 04:49:11,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 04:49:11,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713194334] [2020-12-09 04:49:11,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:49:11,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 04:49:11,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624987357] [2020-12-09 04:49:11,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:49:11,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:11,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:49:11,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:49:11,317 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2020-12-09 04:49:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:11,360 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-12-09 04:49:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:49:11,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 04:49:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:11,360 INFO L225 Difference]: With dead ends: 40 [2020-12-09 04:49:11,361 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 04:49:11,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:49:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 04:49:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-09 04:49:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 04:49:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-12-09 04:49:11,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2020-12-09 04:49:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:11,370 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-12-09 04:49:11,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:49:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-12-09 04:49:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 04:49:11,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:11,370 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:11,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2020-12-09 04:49:11,371 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 697871610, now seen corresponding path program 1 times [2020-12-09 04:49:11,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:11,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439807196] [2020-12-09 04:49:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 04:49:11,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439807196] [2020-12-09 04:49:11,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11311124] [2020-12-09 04:49:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:11,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 68 conjunts are in the unsatisfiable core [2020-12-09 04:49:11,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:49:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 04:49:11,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:49:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 04:49:12,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [696764442] [2020-12-09 04:49:12,181 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:49:12,181 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:49:12,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:49:12,181 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:49:12,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:49:12,271 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:12,729 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:12,802 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:13,034 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:13,432 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:13,442 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:13,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:13,813 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:14,191 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 04:49:14,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:49:14,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 31 [2020-12-09 04:49:14,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864777774] [2020-12-09 04:49:14,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 04:49:14,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 04:49:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2020-12-09 04:49:14,194 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 32 states. [2020-12-09 04:49:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:14,989 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-12-09 04:49:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 04:49:14,990 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 20 [2020-12-09 04:49:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:14,990 INFO L225 Difference]: With dead ends: 39 [2020-12-09 04:49:14,990 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 04:49:14,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=412, Invalid=1658, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 04:49:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 04:49:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2020-12-09 04:49:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 04:49:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-12-09 04:49:15,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 20 [2020-12-09 04:49:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:15,001 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-12-09 04:49:15,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 04:49:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-12-09 04:49:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 04:49:15,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:15,001 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:15,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable421 [2020-12-09 04:49:15,203 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash -763771904, now seen corresponding path program 7 times [2020-12-09 04:49:15,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:15,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183883323] [2020-12-09 04:49:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 04:49:15,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183883323] [2020-12-09 04:49:15,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415935910] [2020-12-09 04:49:15,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:15,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 04:49:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:49:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 04:49:15,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:49:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 04:49:15,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016751682] [2020-12-09 04:49:15,341 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:49:15,341 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:49:15,341 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:49:15,342 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:49:15,342 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:49:15,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:15,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,223 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:16,957 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:17,293 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 04:49:18,124 WARN L197 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2020-12-09 04:49:18,582 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-12-09 04:49:18,758 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-09 04:49:18,975 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2020-12-09 04:49:19,211 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-12-09 04:49:19,480 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 04:49:19,481 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 04:49:19,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:49:19,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2020-12-09 04:49:19,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857996506] [2020-12-09 04:49:19,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:49:19,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:49:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-09 04:49:19,482 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2020-12-09 04:49:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:19,531 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-12-09 04:49:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:49:19,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-09 04:49:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:19,532 INFO L225 Difference]: With dead ends: 36 [2020-12-09 04:49:19,532 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 04:49:19,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-09 04:49:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 04:49:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-12-09 04:49:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-09 04:49:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-12-09 04:49:19,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2020-12-09 04:49:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:19,540 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-12-09 04:49:19,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:49:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-12-09 04:49:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 04:49:19,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:49:19,541 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:49:19,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable517 [2020-12-09 04:49:19,742 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:49:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:49:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash 157675013, now seen corresponding path program 2 times [2020-12-09 04:49:19,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:49:19,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050156164] [2020-12-09 04:49:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:49:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:49:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 04:49:19,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050156164] [2020-12-09 04:49:19,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870978145] [2020-12-09 04:49:19,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:19,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 04:49:19,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 04:49:19,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 04:49:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 04:49:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 04:49:19,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 04:49:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 04:49:19,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1139953144] [2020-12-09 04:49:19,874 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 04:49:19,874 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 04:49:19,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 04:49:19,874 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 04:49:19,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 04:49:19,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:20,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:20,494 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:20,731 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:21,081 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:21,093 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:21,373 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:21,478 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 04:49:21,858 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 04:49:21,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 04:49:21,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2020-12-09 04:49:21,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369709955] [2020-12-09 04:49:21,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:49:21,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:49:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:49:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:49:21,859 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2020-12-09 04:49:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:49:21,912 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-12-09 04:49:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 04:49:21,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 04:49:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:49:21,912 INFO L225 Difference]: With dead ends: 26 [2020-12-09 04:49:21,912 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 04:49:21,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-12-09 04:49:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 04:49:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 04:49:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 04:49:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 04:49:21,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-12-09 04:49:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:49:21,913 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 04:49:21,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:49:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 04:49:21,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 04:49:22,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 04:49:22,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 04:55:35,253 WARN L197 SmtUtils]: Spent 6.22 m on a formula simplification. DAG size of input: 254 DAG size of output: 126 [2020-12-09 04:56:02,589 WARN L197 SmtUtils]: Spent 27.33 s on a formula simplification. DAG size of input: 292 DAG size of output: 121 [2020-12-09 04:56:03,466 WARN L197 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 153 [2020-12-09 04:57:29,113 WARN L197 SmtUtils]: Spent 1.43 m on a formula simplification. DAG size of input: 158 DAG size of output: 59 [2020-12-09 04:57:29,829 WARN L197 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2020-12-09 04:57:30,610 WARN L197 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2020-12-09 04:57:30,615 INFO L265 CegarLoopResult]: At program point L572(line 572) the Hoare annotation is: true [2020-12-09 04:57:30,615 INFO L258 CegarLoopResult]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_sll_update_at_#in~head.offset| 0)) (.cse2 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse3 (<= |ULTIMATE.start_sll_update_at_#in~index| 1)) (.cse5 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse6 (= 2 ULTIMATE.start_main_~len~0)) (.cse8 (<= ULTIMATE.start_sll_create_~len 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse9 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse10 (= ULTIMATE.start_sll_update_at_~head.offset 0)) (.cse4 (select |#memory_int| ULTIMATE.start_main_~s~0.base)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse14 (= |#t~string1.offset| 0)) (.cse13 (<= 0 |#t~string0.base|)) (.cse15 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse16 (<= ULTIMATE.start_main_~data~0 1)) (.cse17 (= |#NULL.base| 0)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_#res.offset|)) (.cse19 (<= 1 ULTIMATE.start_main_~data~0)) (.cse22 (<= |ULTIMATE.start_sll_update_at_#in~data| 3)) (.cse20 (<= 0 ULTIMATE.start_sll_update_at_~index)) (.cse23 (<= 0 |ULTIMATE.start_sll_update_at_#in~head.offset|)) (.cse21 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse24 (<= ULTIMATE.start_sll_create_~data 1)) (.cse25 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse26 (<= 0 |#t~string1.base|)) (.cse27 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse30 (<= ULTIMATE.start_main_~new_data~0 3)) (.cse31 (< 1 ULTIMATE.start_sll_update_at_~data)) (.cse32 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse33 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse35 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse34 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse36 (= |#t~string0.offset| 0))) (or (let ((.cse37 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse37))) (let ((.cse29 (+ (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse37)) 1)) (.cse28 (* 2 ULTIMATE.start_main_~len~0))) (and (not (= ULTIMATE.start_main_~s~0.base .cse0)) .cse1 .cse2 .cse3 (<= (select .cse4 0) ULTIMATE.start_main_~len~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= .cse28 .cse29) .cse30 (= ULTIMATE.start_sll_update_at_~data (select (select |#memory_int| ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset)) .cse31 .cse32 (<= ULTIMATE.start_main_~i~0 1) (<= 1 ULTIMATE.start_main_~i~0) .cse33 (= ULTIMATE.start_main_~s~0.offset 0) .cse34 .cse35 (<= .cse29 .cse28) .cse36)))) (and .cse1 .cse2 .cse3 .cse5 .cse6 (<= ULTIMATE.start_sll_update_at_~data 2) (<= 0 ULTIMATE.start_main_~s~0.offset) .cse8 .cse7 .cse9 .cse10 (<= ULTIMATE.start_main_~s~0.offset 0) (= (+ (select .cse4 ULTIMATE.start_main_~s~0.offset) 2) (* ULTIMATE.start_main_~len~0 2)) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 (<= ULTIMATE.start_sll_get_data_at_~index 0) .cse18 .cse19 .cse22 .cse20 .cse23 .cse21 .cse24 .cse25 .cse26 .cse27 .cse30 .cse31 .cse32 .cse33 .cse35 .cse34 .cse36))) [2020-12-09 04:57:30,615 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 04:57:30,615 INFO L265 CegarLoopResult]: At program point L631(lines 613 632) the Hoare annotation is: true [2020-12-09 04:57:30,615 INFO L258 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse44 (+ ULTIMATE.start_main_~s~0.offset 4)) (.cse43 (+ ULTIMATE.start_main_~i~0 1))) (let ((.cse1 (= ULTIMATE.start_sll_create_~head~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse33 (= ULTIMATE.start_main_~len~0 .cse43)) (.cse14 (= ULTIMATE.start_main_~s~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse19 (= ULTIMATE.start_main_~s~0.offset |ULTIMATE.start_sll_create_#res.offset|)) (.cse21 (= ULTIMATE.start_sll_create_~head~0.offset |ULTIMATE.start_sll_create_#res.offset|)) (.cse7 (<= 0 |#t~string0.base|)) (.cse9 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse10 (<= ULTIMATE.start_main_~data~0 1)) (.cse11 (= |#NULL.base| 0)) (.cse13 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse3 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 0 |#StackHeapBarrier|)) (.cse39 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse44)) (.cse32 (* 2 ULTIMATE.start_main_~len~0)) (.cse31 (+ ULTIMATE.start_sll_update_at_~data 1))) (let ((.cse16 (<= .cse32 .cse31)) (.cse0 (not (= ULTIMATE.start_main_~s~0.base .cse39))) (.cse27 (<= |ULTIMATE.start_sll_update_at_#in~head.offset| 0)) (.cse40 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse2 (<= |ULTIMATE.start_sll_update_at_#in~index| 1)) (.cse28 (<= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse4 (<= ULTIMATE.start_sll_create_~len 0)) (.cse29 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse30 (or (and .cse7 .cse1 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse3 .cse19 .cse21 .cse5 .cse6) (and .cse7 (<= ULTIMATE.start_sll_create_~head~0.offset 0) (<= ULTIMATE.start_sll_create_~len 2) .cse9 .cse10 .cse11 .cse13 .cse3 .cse5 .cse6))) (.cse8 (= |#t~string1.offset| 0)) (.cse34 (<= 0 |ULTIMATE.start_sll_create_#res.offset|)) (.cse12 (<= 1 ULTIMATE.start_main_~data~0)) (.cse35 (<= 0 ULTIMATE.start_sll_update_at_~index)) (.cse36 (<= |ULTIMATE.start_sll_update_at_#in~data| 3)) (.cse37 (<= 0 |ULTIMATE.start_sll_update_at_#in~head.offset|)) (.cse15 (<= ULTIMATE.start_sll_create_~data 1)) (.cse17 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse18 (<= 0 |#t~string1.base|)) (.cse20 (<= ULTIMATE.start_main_~new_data~0 3)) (.cse22 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse41 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse23 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse24 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse25 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse26 (= |#t~string0.offset| 0)) (.cse38 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse44))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_sll_update_at_~index |ULTIMATE.start_sll_update_at_#in~index|) .cse3 (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_sll_update_at_~head.base) (= 2 ULTIMATE.start_main_~len~0) (= |ULTIMATE.start_sll_update_at_#in~data| ULTIMATE.start_sll_update_at_~data) (= ULTIMATE.start_main_~i~0 |ULTIMATE.start_sll_update_at_#in~index|) .cse4 .cse5 (= ULTIMATE.start_main_~new_data~0 |ULTIMATE.start_sll_update_at_#in~data|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_update_at_#in~head.offset| ULTIMATE.start_sll_update_at_~head.offset) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_main_~s~0.base) .cse19 .cse20 .cse21 .cse22 (<= 1 ULTIMATE.start_main_~i~0) .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_sll_update_at_#in~head.offset| ULTIMATE.start_main_~s~0.offset)) (and .cse27 .cse2 .cse28 .cse4 .cse29 .cse30 .cse8 (<= .cse31 .cse32) .cse33 .cse34 .cse12 .cse35 .cse36 .cse37 .cse15 .cse16 .cse17 .cse18 (= .cse38 ULTIMATE.start_sll_update_at_~head.offset) (= ULTIMATE.start_sll_update_at_~head.base .cse39) .cse20 .cse22 (not .cse40) (<= ULTIMATE.start_main_~i~0 1) .cse41 .cse23 .cse24 .cse25 .cse26 (< 0 ULTIMATE.start_main_~i~0)) (let ((.cse42 (+ (select (select |#memory_int| .cse39) .cse38) 1))) (and .cse0 .cse27 .cse40 .cse2 (<= ULTIMATE.start_sll_update_at_~data 2) (= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) .cse28 .cse4 .cse29 (= ULTIMATE.start_sll_update_at_~head.offset 0) .cse30 .cse8 (<= ULTIMATE.start_main_~i~0 0) .cse34 .cse12 .cse35 .cse36 .cse37 .cse15 .cse17 .cse18 (<= .cse32 .cse42) .cse20 (< 0 .cse43) (< 1 ULTIMATE.start_sll_update_at_~data) .cse22 .cse41 .cse23 .cse24 .cse25 (<= .cse42 .cse32) .cse26)))))) [2020-12-09 04:57:30,615 INFO L262 CegarLoopResult]: For program point L624(lines 624 626) no Hoare annotation was computed. [2020-12-09 04:57:30,616 INFO L258 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse48 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse45 (select |#memory_int| ULTIMATE.start_main_~s~0.base)) (.cse47 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse48))) (let ((.cse42 (* 2 ULTIMATE.start_main_~len~0)) (.cse41 (+ (select (select |#memory_int| .cse47) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse48)) 1)) (.cse2 (select .cse45 0))) (let ((.cse7 (= 2 ULTIMATE.start_main_~len~0)) (.cse10 (<= ULTIMATE.start_sll_update_at_~data 2)) (.cse22 (<= ULTIMATE.start_sll_get_data_at_~index 0)) (.cse9 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse0 (not (= ULTIMATE.start_main_~s~0.base .cse47))) (.cse1 (<= |ULTIMATE.start_sll_update_at_#in~head.offset| 0)) (.cse3 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse5 (<= |ULTIMATE.start_sll_update_at_#in~index| 1)) (.cse4 (<= .cse2 ULTIMATE.start_main_~len~0)) (.cse6 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse12 (<= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse11 (<= ULTIMATE.start_sll_create_~len 0)) (.cse13 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse14 (= ULTIMATE.start_sll_update_at_~head.offset 0)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse8 (+ (* 2 (div (+ ULTIMATE.start_main_~expected~0 (- 1)) 2)) 1)) (.cse18 (<= 0 |#t~string0.base|)) (.cse17 (= |#t~string1.offset| 0)) (.cse19 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse20 (<= ULTIMATE.start_main_~data~0 1)) (.cse21 (= |#NULL.base| 0)) (.cse23 (<= 0 |ULTIMATE.start_sll_create_#res.offset|)) (.cse24 (<= 1 ULTIMATE.start_main_~data~0)) (.cse26 (<= 0 ULTIMATE.start_sll_update_at_~index)) (.cse28 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse25 (<= |ULTIMATE.start_sll_update_at_#in~data| 3)) (.cse27 (<= 0 |ULTIMATE.start_sll_update_at_#in~head.offset|)) (.cse29 (<= ULTIMATE.start_sll_create_~data 1)) (.cse30 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse31 (<= 0 |#t~string1.base|)) (.cse32 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse34 (<= .cse42 .cse41)) (.cse33 (<= ULTIMATE.start_main_~new_data~0 3)) (.cse35 (< 1 ULTIMATE.start_sll_update_at_~data)) (.cse36 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse37 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse38 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse40 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse39 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse43 (= |#t~string0.offset| 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_main_~len~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 .cse9) .cse10 (<= .cse9 .cse8) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1)) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= (mod (+ ULTIMATE.start_main_~expected~0 1) 2) 0) .cse37 .cse38 .cse39 .cse40 (<= .cse41 .cse42) .cse43) (let ((.cse44 (div (+ .cse9 2) (- 2)))) (and .cse1 .cse3 .cse5 (= (mod .cse9 (- 2)) 0) .cse6 .cse7 (<= 0 (+ .cse44 2)) .cse10 (= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) .cse11 .cse12 .cse13 .cse14 (= (+ (select .cse45 ULTIMATE.start_main_~s~0.offset) 2) (* ULTIMATE.start_main_~len~0 2)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= (+ (* 2 .cse44) ULTIMATE.start_main_~expected~0 2) 0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 (+ .cse44 ULTIMATE.start_main_~expected~0)) .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse43 (= ULTIMATE.start_sll_get_data_at_~head.offset 0))) (and .cse0 (= |ULTIMATE.start_sll_get_data_at_#in~head.offset| ULTIMATE.start_sll_get_data_at_~head.offset) .cse1 (= ULTIMATE.start_main_~i~0 |ULTIMATE.start_sll_get_data_at_#in~index|) .cse3 (= |ULTIMATE.start_sll_get_data_at_#in~head.offset| ULTIMATE.start_main_~s~0.offset) .cse5 .cse4 (= (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~expected~0) .cse6 .cse12 .cse11 .cse13 (= ULTIMATE.start_main_~s~0.base |ULTIMATE.start_sll_get_data_at_#in~head.base|) .cse14 .cse15 .cse16 (<= (let ((.cse46 (+ ULTIMATE.start_sll_get_data_at_~head.offset 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_get_data_at_~head.base) .cse46)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_get_data_at_~head.base) .cse46))) .cse8) .cse18 .cse17 (<= ULTIMATE.start_sll_get_data_at_~index 1) .cse19 .cse20 .cse21 .cse23 .cse24 .cse26 .cse28 .cse25 .cse27 .cse29 .cse30 .cse31 .cse32 (= ULTIMATE.start_sll_get_data_at_~head.base |ULTIMATE.start_sll_get_data_at_#in~head.base|) .cse34 .cse33 (= ULTIMATE.start_sll_update_at_~data (select (select |#memory_int| ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset)) .cse35 .cse36 .cse37 .cse38 .cse40 .cse39 (= ULTIMATE.start_sll_get_data_at_~index |ULTIMATE.start_sll_get_data_at_#in~index|) .cse43)))))) [2020-12-09 04:57:30,616 INFO L258 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2020-12-09 04:57:30,616 INFO L258 CegarLoopResult]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_sll_create_~head~0.base 0))) (and (let ((.cse21 (select |#memory_int| |#t~string0.base|))) (let ((.cse2 (= (select .cse21 |#t~string0.offset|) 48)) (.cse4 (= (select |#valid| 0) 0)) (.cse11 (= 8 (select |#length| |ULTIMATE.start_node_create_#t~malloc5.base|))) (.cse12 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse15 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (= (select |#valid| |#t~string1.base|) 1)) (.cse18 (< |ULTIMATE.start_node_create_#t~malloc5.base| |#StackHeapBarrier|)) (.cse0 (= |#t~string1.offset| 0)) (.cse1 (= ULTIMATE.start_main_~len~0 |ULTIMATE.start_sll_create_#in~len|)) (.cse3 (= (select .cse21 (+ |#t~string0.offset| 1)) 0)) (.cse5 (= ULTIMATE.start_node_create_~data |ULTIMATE.start_node_create_#in~data|)) (.cse6 (= 2 (select |#length| |#t~string0.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#t~malloc5.base|) 1)) (.cse8 (= ULTIMATE.start_sll_create_~data |ULTIMATE.start_node_create_#in~data|)) (.cse9 (= (select |#length| |#t~string1.base|) 27)) (.cse13 (= (select |#valid| |#t~string0.base|) 1)) (.cse14 (< 0 |#StackHeapBarrier|)) (.cse19 (= |ULTIMATE.start_node_create_#t~malloc5.base| ULTIMATE.start_node_create_~temp~0.base))) (or (and .cse0 .cse1 (= |ULTIMATE.start_sll_create_#in~len| ULTIMATE.start_sll_create_~len) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (+ ULTIMATE.start_sll_create_~new_head~0.offset 4))) (and (= (select |#valid| ULTIMATE.start_sll_create_~new_head~0.base) 1) .cse2 .cse4 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_create_~new_head~0.base) .cse20) 0) (not (= |ULTIMATE.start_node_create_#t~malloc5.base| ULTIMATE.start_sll_create_~new_head~0.base)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~new_head~0.base) .cse20) 0) (< ULTIMATE.start_sll_create_~new_head~0.base |#StackHeapBarrier|) .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse0 .cse1 (= 8 (select |#length| ULTIMATE.start_sll_create_~new_head~0.base)) .cse3 .cse5 (= (+ ULTIMATE.start_sll_create_~len 1) |ULTIMATE.start_sll_create_#in~len|) .cse6 .cse7 .cse8 (= ULTIMATE.start_sll_create_~head~0.base ULTIMATE.start_sll_create_~new_head~0.base) (= ULTIMATE.start_sll_create_~new_head~0.offset 0) .cse9 .cse13 .cse14 .cse19))))) (<= |#NULL.base| 0) (<= ULTIMATE.start_main_~data~0 1) (<= 1 ULTIMATE.start_main_~data~0) (<= 1 |ULTIMATE.start_sll_create_#in~data|) (= 2 ULTIMATE.start_main_~len~0) (<= |ULTIMATE.start_node_create_#t~malloc5.offset| 0) (<= ULTIMATE.start_sll_create_~head~0.offset 0) (<= |#t~string0.offset| 0) (<= 1 |ULTIMATE.start_node_create_#in~data|) (<= 0 |#t~string0.offset|) (or .cse10 (= ULTIMATE.start_sll_create_~data (select (select |#memory_int| ULTIMATE.start_sll_create_~new_head~0.base) 0))) (<= 0 |ULTIMATE.start_node_create_#t~malloc5.offset|) (= ULTIMATE.start_node_create_~temp~0.offset 0) (<= 0 ULTIMATE.start_sll_create_~head~0.offset) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_sll_create_#in~data| 1) (<= |ULTIMATE.start_node_create_#in~data| 1))) [2020-12-09 04:57:30,616 INFO L265 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2020-12-09 04:57:30,616 INFO L258 CegarLoopResult]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse41 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse40 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse41))) (let ((.cse35 (* 2 ULTIMATE.start_main_~len~0)) (.cse34 (+ (select (select |#memory_int| .cse40) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse41)) 1)) (.cse37 (= ULTIMATE.start_sll_create_~head~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse38 (= ULTIMATE.start_main_~s~0.base |ULTIMATE.start_sll_create_#res.base|))) (let ((.cse0 (not (= ULTIMATE.start_main_~s~0.base .cse40))) (.cse1 (<= |ULTIMATE.start_sll_update_at_#in~head.offset| 0)) (.cse2 (<= |ULTIMATE.start_sll_update_at_#in~index| 1)) (.cse3 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse4 (= 2 ULTIMATE.start_main_~len~0)) (.cse5 (or (= ULTIMATE.start_sll_update_at_~data (select (select |#memory_int| ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset)) (and .cse37 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1)) .cse38))) (.cse6 (<= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse7 (<= ULTIMATE.start_sll_create_~len 0)) (.cse8 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse9 (= |#NULL.offset| 0)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (<= 0 |#t~string0.base|)) (.cse12 (= |#t~string1.offset| 0)) (.cse13 (<= ULTIMATE.start_main_~i~0 0)) (.cse14 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse15 (<= ULTIMATE.start_main_~data~0 1)) (.cse16 (= |#NULL.base| 0)) (.cse17 (<= 0 |ULTIMATE.start_sll_create_#res.offset|)) (.cse18 (<= 1 ULTIMATE.start_main_~data~0)) (.cse19 (<= 0 ULTIMATE.start_sll_update_at_~index)) (.cse20 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse21 (<= |ULTIMATE.start_sll_update_at_#in~data| 3)) (.cse22 (<= 0 |ULTIMATE.start_sll_update_at_#in~head.offset|)) (.cse23 (<= ULTIMATE.start_sll_create_~data 1)) (.cse24 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse25 (<= 0 |#t~string1.base|)) (.cse26 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse27 (<= .cse35 .cse34)) (.cse28 (<= ULTIMATE.start_main_~new_data~0 3)) (.cse29 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse30 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse31 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse32 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse33 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse36 (= |#t~string0.offset| 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_sll_update_at_~head.offset 0) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset) 2) (* ULTIMATE.start_main_~len~0 2)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= .cse34 .cse35) .cse36) (and .cse0 .cse37 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (<= |#NULL.base| 0) .cse18 .cse20 .cse38 .cse23 .cse24 .cse25 (= ULTIMATE.start_main_~s~0.offset |ULTIMATE.start_sll_create_#res.offset|) (= ULTIMATE.start_sll_create_~head~0.offset |ULTIMATE.start_sll_create_#res.offset|) .cse29 (<= ULTIMATE.start_main_~i~0 1) (<= 1 ULTIMATE.start_main_~i~0) (<= 0 |#NULL.base|) .cse31 .cse32 .cse33 .cse36) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_sll_update_at_~data 3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 ULTIMATE.start_main_~i~0) .cse13 .cse14 .cse15 .cse16 (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_33 Int) (v_DerPreprocessor_75 Int) (ULTIMATE.start_sll_update_at_~data Int) (v_DerPreprocessor_74 Int)) (or (< ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_33) (<= (+ (let ((.cse39 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select (store |#memory_int| ULTIMATE.start_main_~s~0.base (store (select |#memory_int| ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 ULTIMATE.start_sll_update_at_~data)) (select (store (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_75) .cse39)) (select (store (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_33 v_DerPreprocessor_74) .cse39))) 1) (* 2 ULTIMATE.start_main_~len~0)))) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse36)))))) [2020-12-09 04:57:30,617 INFO L258 CegarLoopResult]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= |#t~string1.offset| 0)) (.cse1 (<= 0 |#t~string0.base|)) (.cse2 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse3 (<= ULTIMATE.start_main_~data~0 1)) (.cse4 (= |#NULL.base| 0)) (.cse5 (<= 1 ULTIMATE.start_main_~data~0)) (.cse6 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse7 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse8 (<= ULTIMATE.start_sll_create_~data 1)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse10 (= 2 ULTIMATE.start_main_~len~0)) (.cse11 (<= 0 |#t~string1.base|)) (.cse12 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse13 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse14 (<= ULTIMATE.start_sll_create_~len 2)) (.cse15 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse16 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse19 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse20 (= |#t~string0.offset| 0)) (.cse21 (<= 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) (+ ULTIMATE.start_sll_create_~head~0.offset 4)) ULTIMATE.start_sll_create_~head~0.base)) (<= 0 ULTIMATE.start_sll_create_~len) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse9 .cse10 .cse11 (= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_create_~len) .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (<= 1 ULTIMATE.start_sll_create_~len) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2020-12-09 04:57:30,617 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2020-12-09 04:57:30,617 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 04:57:30,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] [2020-12-09 04:57:30,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] [2020-12-09 04:57:30,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] [2020-12-09 04:57:30,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,643 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,643 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,643 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,643 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,644 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] [2020-12-09 04:57:30,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,645 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] [2020-12-09 04:57:30,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,645 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] [2020-12-09 04:57:30,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,646 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,646 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,662 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,665 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,666 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,666 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,670 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,670 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:57:30 BoogieIcfgContainer [2020-12-09 04:57:30,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 04:57:30,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 04:57:30,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 04:57:30,675 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 04:57:30,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:05" (3/4) ... [2020-12-09 04:57:30,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 04:57:30,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-12-09 04:57:30,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-12-09 04:57:30,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 04:57:30,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 04:57:30,701 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((("sll2n_update_all_reverse.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && !(#memory_$Pointer$[head][head + 4] == head)) && 0 <= len) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((("sll2n_update_all_reverse.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && len == len) && head <= 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown)) || ((((((((((((((((((((((1 <= len && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) [2020-12-09 04:57:30,701 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((("sll2n_update_all_reverse.c" == 0 && len == \old(len)) && \old(len) == len) && unknown-#memory_int-unknown["0"]["0"] == 48) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && \valid[0] == 0) && data == \old(data)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && unknown-#length-unknown["sll2n_update_all_reverse.c"] == 27) && head == 0) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "sll2n_update_all_reverse.c") && #NULL == 0) && \valid["sll2n_update_all_reverse.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) || (((((((((((((((((((((((((((\valid[new_head] == 1 && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && #memory_$Pointer$[new_head][new_head + 4] == 0) && !(malloc(sizeof(struct node)) == new_head)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all_reverse.c") && #NULL == 0) && \valid["sll2n_update_all_reverse.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && len == \old(len)) && 8 == unknown-#length-unknown[new_head]) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && data == \old(data)) && len + 1 == \old(len)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && head == new_head) && new_head == 0) && unknown-#length-unknown["sll2n_update_all_reverse.c"] == 27) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp)) && #NULL <= 0) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 2 == len) && malloc(sizeof(struct node)) <= 0) && head <= 0) && "0" <= 0) && 1 <= \old(data)) && 0 <= "0") && (head == 0 || data == unknown-#memory_int-unknown[new_head][0])) && 0 <= malloc(sizeof(struct node))) && temp == 0) && 0 <= head) && 0 <= #NULL) && \old(data) <= 1) && \old(data) <= 1 [2020-12-09 04:57:30,701 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && 1 <= data) && 2 == len) && (data == unknown-#memory_int-unknown[head][head] || ((head == \result && len == i + 1) && s == \result))) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && i <= 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || (((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == \result) && 1 <= data) && 2 == len) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL <= 0) && 1 <= data) && 0 <= len) && s == \result) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && s == \result) && head == \result) && temp == 0) && i <= 1) && 1 <= i) && 0 <= #NULL) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0)) || (((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && \old(index) <= 1) && 1 <= data) && data <= 3) && 2 == len) && (data == unknown-#memory_int-unknown[head][head] || ((head == \result && len == i + 1) && s == \result))) && \result <= 0) && len <= 0) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 0 <= i) && i <= 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && (forall v_ULTIMATE.start_sll_update_at_~head.offset_33 : int, v_DerPreprocessor_75 : int, ULTIMATE.start_sll_update_at_~data : int, v_DerPreprocessor_74 : int :: s < v_ULTIMATE.start_sll_update_at_~head.offset_33 || unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := ULTIMATE.start_sll_update_at_~data]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := v_DerPreprocessor_75][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := v_DerPreprocessor_74][s + 4]] + 1 <= 2 * len)) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) [2020-12-09 04:57:30,701 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && unknown-#memory_int-unknown[s][0] <= len) && 1 <= data) && 2 == len) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && data == unknown-#memory_int-unknown[head][head]) && 1 < data) && temp == 0) && i <= 1) && 1 <= i) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || ((((((((((((((((((((((((((((((((((((((head <= 0 && s == head) && \old(index) <= 1) && 1 <= data) && 2 == len) && data <= 2) && 0 <= s) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && s <= 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && i + 2 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 1 < data) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) [2020-12-09 04:57:30,702 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == \result) && \old(index) <= 1) && index == \old(index)) && 1 <= data) && head == head) && 2 == len) && \old(data) == data) && i == \old(index)) && len <= 0) && #NULL == 0) && new_data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && head == head) && 1 <= data) && 0 <= len) && s == \result) && data <= 1) && 2 * len <= data + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head == s) && s == \result) && new_data <= 3) && head == \result) && temp == 0) && 1 <= i) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) && head == s) || (((((((((((((((((((((((((((((head <= 0 && \old(index) <= 1) && \result <= 0) && len <= 0) && index <= 0) && (((((((((((((0 <= "0" && head == \result) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && len == i + 1) && 0 <= len) && s == \result) && 1 <= data) && s == \result) && head == \result) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((0 <= "0" && head <= 0) && len <= 2) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= len) && 1 <= data) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown))) && "sll2n_update_all_reverse.c" == 0) && data + 1 <= 2 * len) && len == i + 1) && 0 <= \result) && 1 <= data) && 0 <= index) && \old(data) <= 3) && 0 <= head) && data <= 1) && 2 * len <= data + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && new_data <= 3) && temp == 0) && !(s == head)) && i <= 1) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) && 0 < i)) || (((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && data <= 2) && i + 2 == len) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && (((((((((((((0 <= "0" && head == \result) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && len == i + 1) && 0 <= len) && s == \result) && 1 <= data) && s == \result) && head == \result) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((0 <= "0" && head <= 0) && len <= 2) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= len) && 1 <= data) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown))) && "sll2n_update_all_reverse.c" == 0) && i <= 0) && 0 <= \result) && 1 <= data) && 0 <= index) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && 0 < i + 1) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) [2020-12-09 04:57:30,702 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= unknown-#memory_int-unknown[s][0]) && s == head) && unknown-#memory_int-unknown[s][0] <= len) && \old(index) <= 1) && 1 <= data) && 2 == len) && 2 * ((expected + -1) / 2) + 1 <= unknown-#memory_int-unknown[head][head]) && data <= 2) && unknown-#memory_int-unknown[head][head] <= 2 * ((expected + -1) / 2) + 1) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && len == i + 1) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 1 < data) && temp == 0) && (expected + 1) % 2 == 0) && 0 <= head) && s == 0) && \old(len) <= 2) && \old(data) <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || ((((((((((((((((((((((((((((((((((((((((((head <= 0 && s == head) && \old(index) <= 1) && unknown-#memory_int-unknown[head][head] % -2 == 0) && 1 <= data) && 2 == len) && 0 <= (unknown-#memory_int-unknown[head][head] + 2) / -2 + 2) && data <= 2) && i + 2 == len) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 2) / -2) + expected + 2 <= 0) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 0 <= (unknown-#memory_int-unknown[head][head] + 2) / -2 + expected) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && head == 0)) || (((((((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == head) && head <= 0) && i == \old(index)) && s == head) && head == s) && \old(index) <= 1) && unknown-#memory_int-unknown[s][0] <= len) && len + i == expected) && 1 <= data) && \result <= 0) && len <= 0) && index <= 0) && s == head) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= 2 * ((expected + -1) / 2) + 1) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && index <= 1) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && head == head) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && data == unknown-#memory_int-unknown[head][head]) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && index == \old(index)) && "0" == 0) [2020-12-09 04:57:30,711 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7cc864d8-bf7e-4902-882f-b64f4f171b14/bin/utaipan/witness.graphml [2020-12-09 04:57:30,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 04:57:30,711 INFO L168 Benchmark]: Toolchain (without parser) took 565682.78 ms. Allocated memory was 117.4 MB in the beginning and 249.6 MB in the end (delta: 132.1 MB). Free memory was 77.6 MB in the beginning and 162.1 MB in the end (delta: -84.5 MB). Peak memory consumption was 46.9 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,711 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 117.4 MB. Free memory is still 95.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.43 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 79.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.40 ms. Allocated memory is still 117.4 MB. Free memory was 79.0 MB in the beginning and 76.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 117.4 MB. Free memory was 76.9 MB in the beginning and 75.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: RCFGBuilder took 374.18 ms. Allocated memory is still 117.4 MB. Free memory was 75.4 MB in the beginning and 88.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: TraceAbstraction took 564905.34 ms. Allocated memory was 117.4 MB in the beginning and 249.6 MB in the end (delta: 132.1 MB). Free memory was 88.1 MB in the beginning and 165.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 155.4 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,712 INFO L168 Benchmark]: Witness Printer took 35.81 ms. Allocated memory is still 249.6 MB. Free memory was 165.3 MB in the beginning and 162.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 04:57:30,713 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 117.4 MB. Free memory is still 95.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 307.43 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 79.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.40 ms. Allocated memory is still 117.4 MB. Free memory was 79.0 MB in the beginning and 76.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 117.4 MB. Free memory was 76.9 MB in the beginning and 75.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 374.18 ms. Allocated memory is still 117.4 MB. Free memory was 75.4 MB in the beginning and 88.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 564905.34 ms. Allocated memory was 117.4 MB in the beginning and 249.6 MB in the end (delta: 132.1 MB). Free memory was 88.1 MB in the beginning and 165.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 155.4 MB. Max. memory is 16.1 GB. * Witness Printer took 35.81 ms. Allocated memory is still 249.6 MB. Free memory was 165.3 MB in the beginning and 162.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 618]: Loop Invariant [2020-12-09 04:57:30,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,718 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,718 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,718 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,718 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] [2020-12-09 04:57:30,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_update_at_~data,QUANTIFIED] [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_75,QUANTIFIED] [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_74,QUANTIFIED] [2020-12-09 04:57:30,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_33,QUANTIFIED] [2020-12-09 04:57:30,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && 1 <= data) && 2 == len) && (data == unknown-#memory_int-unknown[head][head] || ((head == \result && len == i + 1) && s == \result))) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && i <= 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || (((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == \result) && 1 <= data) && 2 == len) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL <= 0) && 1 <= data) && 0 <= len) && s == \result) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && s == \result) && head == \result) && temp == 0) && i <= 1) && 1 <= i) && 0 <= #NULL) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0)) || (((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && \old(index) <= 1) && 1 <= data) && data <= 3) && 2 == len) && (data == unknown-#memory_int-unknown[head][head] || ((head == \result && len == i + 1) && s == \result))) && \result <= 0) && len <= 0) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 0 <= i) && i <= 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && (forall v_ULTIMATE.start_sll_update_at_~head.offset_33 : int, v_DerPreprocessor_75 : int, ULTIMATE.start_sll_update_at_~data : int, v_DerPreprocessor_74 : int :: s < v_ULTIMATE.start_sll_update_at_~head.offset_33 || unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := ULTIMATE.start_sll_update_at_~data]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := v_DerPreprocessor_75][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head.offset_33 := v_DerPreprocessor_74][s + 4]] + 1 <= 2 * len)) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) - InvariantResult [Line: 607]: Loop Invariant [2020-12-09 04:57:30,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == \result) && \old(index) <= 1) && index == \old(index)) && 1 <= data) && head == head) && 2 == len) && \old(data) == data) && i == \old(index)) && len <= 0) && #NULL == 0) && new_data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && head == head) && 1 <= data) && 0 <= len) && s == \result) && data <= 1) && 2 * len <= data + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head == s) && s == \result) && new_data <= 3) && head == \result) && temp == 0) && 1 <= i) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) && head == s) || (((((((((((((((((((((((((((((head <= 0 && \old(index) <= 1) && \result <= 0) && len <= 0) && index <= 0) && (((((((((((((0 <= "0" && head == \result) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && len == i + 1) && 0 <= len) && s == \result) && 1 <= data) && s == \result) && head == \result) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((0 <= "0" && head <= 0) && len <= 2) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= len) && 1 <= data) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown))) && "sll2n_update_all_reverse.c" == 0) && data + 1 <= 2 * len) && len == i + 1) && 0 <= \result) && 1 <= data) && 0 <= index) && \old(data) <= 3) && 0 <= head) && data <= 1) && 2 * len <= data + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && new_data <= 3) && temp == 0) && !(s == head)) && i <= 1) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && "0" == 0) && 0 < i)) || (((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && data <= 2) && i + 2 == len) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && (((((((((((((0 <= "0" && head == \result) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && len == i + 1) && 0 <= len) && s == \result) && 1 <= data) && s == \result) && head == \result) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((0 <= "0" && head <= 0) && len <= 2) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= len) && 1 <= data) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown))) && "sll2n_update_all_reverse.c" == 0) && i <= 0) && 0 <= \result) && 1 <= data) && 0 <= index) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && 0 < i + 1) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2020-12-09 04:57:30,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((("sll2n_update_all_reverse.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && !(#memory_$Pointer$[head][head + 4] == head)) && 0 <= len) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((("sll2n_update_all_reverse.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && len == len) && head <= 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown)) || ((((((((((((((((((((((1 <= len && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all_reverse.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 600]: Loop Invariant [2020-12-09 04:57:30,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= unknown-#memory_int-unknown[s][0]) && s == head) && unknown-#memory_int-unknown[s][0] <= len) && \old(index) <= 1) && 1 <= data) && 2 == len) && 2 * ((expected + -1) / 2) + 1 <= unknown-#memory_int-unknown[head][head]) && data <= 2) && unknown-#memory_int-unknown[head][head] <= 2 * ((expected + -1) / 2) + 1) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && len == i + 1) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && 1 < data) && temp == 0) && (expected + 1) % 2 == 0) && 0 <= head) && s == 0) && \old(len) <= 2) && \old(data) <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || ((((((((((((((((((((((((((((((((((((((((((head <= 0 && s == head) && \old(index) <= 1) && unknown-#memory_int-unknown[head][head] % -2 == 0) && 1 <= data) && 2 == len) && 0 <= (unknown-#memory_int-unknown[head][head] + 2) / -2 + 2) && data <= 2) && i + 2 == len) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 2) / -2) + expected + 2 <= 0) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 0 <= (unknown-#memory_int-unknown[head][head] + 2) / -2 + expected) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && head == 0)) || (((((((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head == head) && head <= 0) && i == \old(index)) && s == head) && head == s) && \old(index) <= 1) && unknown-#memory_int-unknown[s][0] <= len) && len + i == expected) && 1 <= data) && \result <= 0) && len <= 0) && index <= 0) && s == head) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= 2 * ((expected + -1) / 2) + 1) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && index <= 1) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && head == head) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && data == unknown-#memory_int-unknown[head][head]) && 1 < data) && temp == 0) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && index == \old(index)) && "0" == 0) - InvariantResult [Line: 622]: Loop Invariant [2020-12-09 04:57:30,734 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,735 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,735 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,735 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,735 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((!(s == #memory_$Pointer$[s][s + 4]) && head <= 0) && s == head) && \old(index) <= 1) && unknown-#memory_int-unknown[s][0] <= len) && 1 <= data) && 2 == len) && \result <= 0) && len <= 0) && index <= 0) && head == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && "sll2n_update_all_reverse.c" == 0) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 0 <= \result) && 1 <= data) && 0 <= index) && 0 <= len) && \old(data) <= 3) && 0 <= head) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && new_data <= 3) && data == unknown-#memory_int-unknown[head][head]) && 1 < data) && temp == 0) && i <= 1) && 1 <= i) && 0 <= head) && s == 0) && \old(data) <= 1) && \old(len) <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && "0" == 0) || ((((((((((((((((((((((((((((((((((((((head <= 0 && s == head) && \old(index) <= 1) && 1 <= data) && 2 == len) && data <= 2) && 0 <= s) && len <= 0) && \result <= 0) && index <= 0) && head == 0) && s <= 0) && unknown-#memory_int-unknown[s][s] + 2 == len * 2) && i + 2 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 0 <= \result) && 1 <= data) && \old(data) <= 3) && 0 <= index) && 0 <= head) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all_reverse.c") && head <= 0) && new_data <= 3) && 1 < data) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) - InvariantResult [Line: 576]: Loop Invariant [2020-12-09 04:57:30,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 04:57:30,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 04:57:30,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((("sll2n_update_all_reverse.c" == 0 && len == \old(len)) && \old(len) == len) && unknown-#memory_int-unknown["0"]["0"] == 48) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && \valid[0] == 0) && data == \old(data)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && unknown-#length-unknown["sll2n_update_all_reverse.c"] == 27) && head == 0) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "sll2n_update_all_reverse.c") && #NULL == 0) && \valid["sll2n_update_all_reverse.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) || (((((((((((((((((((((((((((\valid[new_head] == 1 && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && #memory_$Pointer$[new_head][new_head + 4] == 0) && !(malloc(sizeof(struct node)) == new_head)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all_reverse.c") && #NULL == 0) && \valid["sll2n_update_all_reverse.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all_reverse.c" == 0) && len == \old(len)) && 8 == unknown-#length-unknown[new_head]) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && data == \old(data)) && len + 1 == \old(len)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && head == new_head) && new_head == 0) && unknown-#length-unknown["sll2n_update_all_reverse.c"] == 27) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp)) && #NULL <= 0) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 2 == len) && malloc(sizeof(struct node)) <= 0) && head <= 0) && "0" <= 0) && 1 <= \old(data)) && 0 <= "0") && (head == 0 || data == unknown-#memory_int-unknown[new_head][0])) && 0 <= malloc(sizeof(struct node))) && temp == 0) && 0 <= head) && 0 <= #NULL) && \old(data) <= 1) && \old(data) <= 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 76.3s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 488.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 435 SDslu, 264 SDs, 0 SdLazy, 733 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 287 SyntacticMatches, 11 SemanticMatches, 184 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 50 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 27 NumberOfFragments, 2416 HoareAnnotationTreeSize, 10 FomulaSimplifications, 7863 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 5100 FormulaSimplificationTreeSizeReductionInter, 488.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.0s InterpolantComputationTime, 346 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 462 ConstructedInterpolants, 6 QuantifiedInterpolants, 71013 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1712 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 232/313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 4253, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 35, TOOLS_POST_TIME[ms]: 3723, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 33, TOOLS_QUANTIFIERELIM_TIME[ms]: 3710, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 716, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 72, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 9, DOMAIN_JOIN_TIME[ms]: 235, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME[ms]: 194, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME[ms]: 17, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME[ms]: 38, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2532, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2532, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 13, DAG_COMPRESSION_PROCESSED_NODES: 374, DAG_COMPRESSION_RETAINED_NODES: 68, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...