./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.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_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 8db9818917d4101818df459d2d32c905a41e37ef ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:10:41,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:10:41,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:10:41,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:10:41,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:10:41,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:10:41,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:10:41,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:10:41,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:10:41,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:10:41,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:10:41,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:10:41,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:10:41,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:10:41,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:10:41,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:10:41,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:10:41,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:10:41,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:10:41,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:10:41,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:10:41,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:10:41,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:10:41,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:10:41,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:10:41,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:10:41,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:10:41,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:10:41,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:10:41,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:10:41,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:10:41,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:10:41,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:10:41,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:10:41,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:10:41,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:10:41,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:10:41,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:10:41,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:10:41,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:10:41,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:10:41,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:10:41,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:10:41,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:10:41,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:10:41,792 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:10:41,792 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:10:41,792 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:10:41,792 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:10:41,792 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:10:41,793 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:10:41,793 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:10:41,793 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:10:41,793 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:10:41,793 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:10:41,794 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:10:41,794 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:10:41,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:10:41,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:10:41,796 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:10:41,796 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:10:41,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:10:41,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:10:41,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:10:41,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:10:41,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:10:41,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:10:41,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:10:41,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:10:41,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:10:41,798 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:10:41,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:10:41,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:10:41,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:10:41,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:10:41,798 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_3821a9b8-3081-4625-8b5c-2723cddae17d/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_3821a9b8-3081-4625-8b5c-2723cddae17d/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 -> 8db9818917d4101818df459d2d32c905a41e37ef [2020-12-09 18:10:41,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:10:41,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:10:41,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:10:41,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:10:41,997 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:10:41,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 18:10:42,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/data/5896e4829/dfe6028c3de543b2abe6cec1a25f0186/FLAGfc2825ef4 [2020-12-09 18:10:42,460 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:10:42,460 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 18:10:42,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/data/5896e4829/dfe6028c3de543b2abe6cec1a25f0186/FLAGfc2825ef4 [2020-12-09 18:10:42,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/data/5896e4829/dfe6028c3de543b2abe6cec1a25f0186 [2020-12-09 18:10:42,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:10:42,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:10:42,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:10:42,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:10:42,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:10:42,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb47b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42, skipping insertion in model container [2020-12-09 18:10:42,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:10:42,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:10:42,709 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_3821a9b8-3081-4625-8b5c-2723cddae17d/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 18:10:42,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:10:42,718 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:10:42,747 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_3821a9b8-3081-4625-8b5c-2723cddae17d/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 18:10:42,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:10:42,783 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:10:42,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42 WrapperNode [2020-12-09 18:10:42,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:10:42,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:10:42,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:10:42,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:10:42,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:10:42,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:10:42,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:10:42,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:10:42,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... [2020-12-09 18:10:42,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:10:42,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:10:42,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:10:42,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:10:42,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:10:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 18:10:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 18:10:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 18:10:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:10:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:10:43,231 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:10:43,231 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-09 18:10:43,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:10:43 BoogieIcfgContainer [2020-12-09 18:10:43,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:10:43,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:10:43,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:10:43,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:10:43,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:10:42" (1/3) ... [2020-12-09 18:10:43,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2726cca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:10:43, skipping insertion in model container [2020-12-09 18:10:43,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:10:42" (2/3) ... [2020-12-09 18:10:43,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2726cca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:10:43, skipping insertion in model container [2020-12-09 18:10:43,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:10:43" (3/3) ... [2020-12-09 18:10:43,239 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2020-12-09 18:10:43,249 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:10:43,252 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:10:43,259 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:10:43,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:10:43,275 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:10:43,275 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:10:43,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:10:43,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:10:43,275 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:10:43,275 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:10:43,275 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:10:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-12-09 18:10:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 18:10:43,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:43,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:43,288 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash 926181436, now seen corresponding path program 1 times [2020-12-09 18:10:43,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:43,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066268920] [2020-12-09 18:10:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:43,410 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 18:10:43,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066268920] [2020-12-09 18:10:43,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:10:43,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:10:43,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907962024] [2020-12-09 18:10:43,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:10:43,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:10:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:10:43,426 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-12-09 18:10:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:43,449 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-12-09 18:10:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:10:43,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 18:10:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:43,456 INFO L225 Difference]: With dead ends: 27 [2020-12-09 18:10:43,456 INFO L226 Difference]: Without dead ends: 12 [2020-12-09 18:10:43,458 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 18:10:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-12-09 18:10:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-12-09 18:10:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-12-09 18:10:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-12-09 18:10:43,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2020-12-09 18:10:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:43,479 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-12-09 18:10:43,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:10:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-12-09 18:10:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 18:10:43,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:43,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:43,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 18:10:43,480 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1018795863, now seen corresponding path program 1 times [2020-12-09 18:10:43,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:43,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269428122] [2020-12-09 18:10:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:10:43,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269428122] [2020-12-09 18:10:43,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700114116] [2020-12-09 18:10:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:10:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:43,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:10:43,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:10:43,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:10:43,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [843574575] [2020-12-09 18:10:43,683 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2020-12-09 18:10:43,683 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:43,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:10:43,690 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:10:43,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:10:43,918 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:44,717 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:44,774 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:45,100 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:45,559 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:45,626 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:45,876 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:10:46,476 WARN L197 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 104 [2020-12-09 18:10:46,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:46,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2020-12-09 18:10:46,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904106373] [2020-12-09 18:10:46,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:10:46,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:10:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:10:46,589 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2020-12-09 18:10:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:46,644 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-12-09 18:10:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:10:46,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 18:10:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:46,645 INFO L225 Difference]: With dead ends: 18 [2020-12-09 18:10:46,645 INFO L226 Difference]: Without dead ends: 13 [2020-12-09 18:10:46,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:10:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-12-09 18:10:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-12-09 18:10:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-12-09 18:10:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-12-09 18:10:46,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-12-09 18:10:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:46,649 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-12-09 18:10:46,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:10:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-12-09 18:10:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 18:10:46,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:46,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:46,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 18:10:46,851 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -548738254, now seen corresponding path program 1 times [2020-12-09 18:10:46,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:46,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127025048] [2020-12-09 18:10:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:46,891 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 18:10:46,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127025048] [2020-12-09 18:10:46,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227936921] [2020-12-09 18:10:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:10:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:46,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:10:46,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:46,958 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 18:10:46,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:46,969 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 18:10:46,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [590318584] [2020-12-09 18:10:46,972 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:10:46,972 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:46,972 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:10:46,972 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:10:46,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:10:47,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,121 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,345 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,510 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,708 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:47,960 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:48,058 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:48,186 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:10:48,496 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2020-12-09 18:10:48,948 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2020-12-09 18:10:49,528 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-12-09 18:10:49,736 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-12-09 18:10:49,954 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-12-09 18:10:50,203 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-12-09 18:10:50,467 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2020-12-09 18:10:50,469 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:10:50,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:50,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 18:10:50,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165296621] [2020-12-09 18:10:50,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:10:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:10:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:10:50,471 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2020-12-09 18:10:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:50,492 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-12-09 18:10:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:10:50,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 18:10:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:50,493 INFO L225 Difference]: With dead ends: 22 [2020-12-09 18:10:50,493 INFO L226 Difference]: Without dead ends: 14 [2020-12-09 18:10:50,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:10:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-09 18:10:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-09 18:10:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-09 18:10:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-12-09 18:10:50,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2020-12-09 18:10:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:50,497 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-12-09 18:10:50,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:10:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-12-09 18:10:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:10:50,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:50,498 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:50,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-12-09 18:10:50,699 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 408743199, now seen corresponding path program 2 times [2020-12-09 18:10:50,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:50,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136473167] [2020-12-09 18:10:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:10:50,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136473167] [2020-12-09 18:10:50,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018636736] [2020-12-09 18:10:50,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:10:50,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 18:10:50,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:50,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:10:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:10:50,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:10:50,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [868660876] [2020-12-09 18:10:50,888 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:10:50,888 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:50,888 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:10:50,888 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:10:50,888 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:10:50,999 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:51,468 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:51,480 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:51,755 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:52,037 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:52,075 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:52,437 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:52,506 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:10:52,641 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:10:53,257 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2020-12-09 18:10:53,731 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2020-12-09 18:10:54,155 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2020-12-09 18:10:54,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:54,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 4, 4] total 13 [2020-12-09 18:10:54,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192235838] [2020-12-09 18:10:54,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 18:10:54,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 18:10:54,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:10:54,158 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 6 states. [2020-12-09 18:10:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:54,242 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-12-09 18:10:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 18:10:54,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 18:10:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:54,243 INFO L225 Difference]: With dead ends: 21 [2020-12-09 18:10:54,243 INFO L226 Difference]: Without dead ends: 16 [2020-12-09 18:10:54,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:10:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-09 18:10:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-12-09 18:10:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-12-09 18:10:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-12-09 18:10:54,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 13 [2020-12-09 18:10:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:54,250 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-12-09 18:10:54,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 18:10:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-12-09 18:10:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 18:10:54,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:54,251 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:54,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:54,452 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -611550638, now seen corresponding path program 1 times [2020-12-09 18:10:54,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:54,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349309729] [2020-12-09 18:10:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:10:54,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349309729] [2020-12-09 18:10:54,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:10:54,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:10:54,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397135477] [2020-12-09 18:10:54,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:10:54,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:10:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:10:54,518 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 4 states. [2020-12-09 18:10:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:54,542 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-12-09 18:10:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:10:54,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 18:10:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:54,543 INFO L225 Difference]: With dead ends: 30 [2020-12-09 18:10:54,543 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 18:10:54,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:10:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 18:10:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2020-12-09 18:10:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 18:10:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-12-09 18:10:54,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2020-12-09 18:10:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:54,548 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-12-09 18:10:54,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:10:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-12-09 18:10:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 18:10:54,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:54,549 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:54,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-12-09 18:10:54,549 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1178673559, now seen corresponding path program 2 times [2020-12-09 18:10:54,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:54,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733767136] [2020-12-09 18:10:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:10:54,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733767136] [2020-12-09 18:10:54,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125834855] [2020-12-09 18:10:54,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:10:54,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 18:10:54,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:54,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjunts are in the unsatisfiable core [2020-12-09 18:10:54,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:10:55,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:06,147 WARN L197 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 18:11:09,571 WARN L197 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 31 [2020-12-09 18:11:10,632 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_sll_update_at_~data Int) (v_subst_1 Int)) (< (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_subst_1 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) (+ c_ULTIMATE.start_main_~len~0 1))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) v_prenex_2 v_prenex_1))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2020-12-09 18:11:10,834 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-12-09 18:11:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 18:11:11,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1488773445] [2020-12-09 18:11:11,018 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:11,018 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:11,019 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:11,019 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:11,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:11,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:11,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:11,119 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:11,349 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:11,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:11,764 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:12,127 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:11:12,423 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-12-09 18:11:12,952 WARN L197 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2020-12-09 18:11:13,573 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2020-12-09 18:11:13,813 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 18:11:14,045 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2020-12-09 18:11:14,338 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2020-12-09 18:11:14,648 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2020-12-09 18:11:14,649 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:11:14,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:14,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2020-12-09 18:11:14,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738246802] [2020-12-09 18:11:14,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 18:11:14,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:14,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 18:11:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1400, Unknown=7, NotChecked=76, Total=1640 [2020-12-09 18:11:14,650 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 33 states. [2020-12-09 18:11:16,597 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-12-09 18:11:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:17,091 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-12-09 18:11:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 18:11:17,091 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 16 [2020-12-09 18:11:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:17,092 INFO L225 Difference]: With dead ends: 44 [2020-12-09 18:11:17,093 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 18:11:17,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=455, Invalid=2734, Unknown=7, NotChecked=110, Total=3306 [2020-12-09 18:11:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 18:11:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 25. [2020-12-09 18:11:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 18:11:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-12-09 18:11:17,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 16 [2020-12-09 18:11:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:17,102 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-12-09 18:11:17,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 18:11:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-12-09 18:11:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 18:11:17,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:17,102 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:17,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:17,304 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2114316918, now seen corresponding path program 1 times [2020-12-09 18:11:17,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:17,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174753286] [2020-12-09 18:11:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:11:17,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174753286] [2020-12-09 18:11:17,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:11:17,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:11:17,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087995999] [2020-12-09 18:11:17,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:11:17,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:17,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:11:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:11:17,333 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-12-09 18:11:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:17,358 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-12-09 18:11:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:11:17,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-09 18:11:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:17,359 INFO L225 Difference]: With dead ends: 36 [2020-12-09 18:11:17,359 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 18:11:17,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:11:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 18:11:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-12-09 18:11:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 18:11:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-12-09 18:11:17,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2020-12-09 18:11:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:17,370 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-12-09 18:11:17,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:11:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-12-09 18:11:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 18:11:17,371 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:17,371 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:17,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2020-12-09 18:11:17,371 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1718137416, now seen corresponding path program 3 times [2020-12-09 18:11:17,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:17,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931751379] [2020-12-09 18:11:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:11:17,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931751379] [2020-12-09 18:11:17,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961055705] [2020-12-09 18:11:17,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:11:17,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 18:11:17,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:11:17,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 18:11:17,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:11:17,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:11:17,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227565080] [2020-12-09 18:11:17,502 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:17,502 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:17,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:17,503 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:17,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:17,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:18,135 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:18,147 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:18,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:18,741 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:18,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:19,328 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:11:19,458 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-12-09 18:11:20,010 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 104 [2020-12-09 18:11:20,262 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-12-09 18:11:20,619 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2020-12-09 18:11:20,620 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:11:20,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:20,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2020-12-09 18:11:20,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100761231] [2020-12-09 18:11:20,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 18:11:20,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 18:11:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-12-09 18:11:20,621 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 7 states. [2020-12-09 18:11:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:20,671 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2020-12-09 18:11:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:11:20,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 18:11:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:20,671 INFO L225 Difference]: With dead ends: 45 [2020-12-09 18:11:20,671 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 18:11:20,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-12-09 18:11:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 18:11:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-09 18:11:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 18:11:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-12-09 18:11:20,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 17 [2020-12-09 18:11:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:20,679 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-12-09 18:11:20,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 18:11:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2020-12-09 18:11:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 18:11:20,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:20,680 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:20,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:20,881 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash -722954048, now seen corresponding path program 4 times [2020-12-09 18:11:20,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:20,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895422581] [2020-12-09 18:11:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:11:20,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895422581] [2020-12-09 18:11:20,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79149349] [2020-12-09 18:11:20,934 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:11:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:20,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:11:20,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:11:20,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:11:21,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673236461] [2020-12-09 18:11:21,011 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:21,011 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:21,011 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:21,011 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:21,012 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:21,078 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:21,568 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:21,619 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:21,826 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:22,195 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:22,206 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:22,698 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:11:22,896 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-12-09 18:11:23,474 WARN L197 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 104 [2020-12-09 18:11:23,682 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-12-09 18:11:24,003 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2020-12-09 18:11:24,239 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2020-12-09 18:11:24,498 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-12-09 18:11:24,499 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:11:24,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:24,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2020-12-09 18:11:24,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467220313] [2020-12-09 18:11:24,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 18:11:24,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 18:11:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:11:24,500 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2020-12-09 18:11:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:24,534 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2020-12-09 18:11:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:11:24,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 18:11:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:24,535 INFO L225 Difference]: With dead ends: 41 [2020-12-09 18:11:24,535 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 18:11:24,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-12-09 18:11:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 18:11:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-12-09 18:11:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 18:11:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-12-09 18:11:24,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2020-12-09 18:11:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:24,543 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-12-09 18:11:24,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 18:11:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-12-09 18:11:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 18:11:24,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:24,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:24,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:24,745 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1817993461, now seen corresponding path program 1 times [2020-12-09 18:11:24,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:24,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536311378] [2020-12-09 18:11:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:11:24,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536311378] [2020-12-09 18:11:24,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754688372] [2020-12-09 18:11:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:11:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:24,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:11:24,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:11:24,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:11:24,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [82570799] [2020-12-09 18:11:24,895 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:24,895 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:24,895 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:24,895 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:24,896 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:24,960 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:25,341 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:25,353 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:25,653 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:25,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:25,903 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:26,551 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:11:26,745 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-12-09 18:11:27,377 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 112 [2020-12-09 18:11:27,683 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2020-12-09 18:11:27,831 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-09 18:11:28,301 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2020-12-09 18:11:28,489 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2020-12-09 18:11:28,764 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2020-12-09 18:11:28,765 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:11:28,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:28,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2020-12-09 18:11:28,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165340414] [2020-12-09 18:11:28,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 18:11:28,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 18:11:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:11:28,766 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 6 states. [2020-12-09 18:11:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:28,799 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-09 18:11:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:11:28,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 18:11:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:28,800 INFO L225 Difference]: With dead ends: 36 [2020-12-09 18:11:28,800 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 18:11:28,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-12-09 18:11:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 18:11:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-12-09 18:11:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 18:11:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-12-09 18:11:28,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2020-12-09 18:11:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:28,809 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-12-09 18:11:28,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 18:11:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-12-09 18:11:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 18:11:28,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:28,810 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:29,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:29,011 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1216549230, now seen corresponding path program 5 times [2020-12-09 18:11:29,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:29,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018322528] [2020-12-09 18:11:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 18:11:29,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018322528] [2020-12-09 18:11:29,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721586075] [2020-12-09 18:11:29,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:11:29,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-09 18:11:29,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:11:29,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:11:29,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 18:11:29,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 18:11:29,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:11:29,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 12 [2020-12-09 18:11:29,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607058639] [2020-12-09 18:11:29,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 18:11:29,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 18:11:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:11:29,255 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 9 states. [2020-12-09 18:11:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:29,288 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-12-09 18:11:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 18:11:29,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-09 18:11:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:29,288 INFO L225 Difference]: With dead ends: 39 [2020-12-09 18:11:29,288 INFO L226 Difference]: Without dead ends: 21 [2020-12-09 18:11:29,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:11:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-12-09 18:11:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-12-09 18:11:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-09 18:11:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-12-09 18:11:29,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2020-12-09 18:11:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:29,294 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-12-09 18:11:29,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 18:11:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-12-09 18:11:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 18:11:29,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:29,294 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:29,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable526 [2020-12-09 18:11:29,496 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 521714026, now seen corresponding path program 1 times [2020-12-09 18:11:29,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:29,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730164979] [2020-12-09 18:11:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:11:29,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730164979] [2020-12-09 18:11:29,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008124454] [2020-12-09 18:11:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/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 18:11:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:29,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 84 conjunts are in the unsatisfiable core [2020-12-09 18:11:29,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:11:30,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:30,896 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_ULTIMATE.start_main_~i~0) (<= c_ULTIMATE.start_main_~i~0 0) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_53 Int) (v_DerPreprocessor_126 Int)) (or (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_53 v_DerPreprocessor_126) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_53)))) is different from false [2020-12-09 18:11:31,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_53 Int) (v_DerPreprocessor_126 Int)) (or (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_53 v_DerPreprocessor_126) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_53))) is different from false [2020-12-09 18:11:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-09 18:11:31,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [698518087] [2020-12-09 18:11:31,332 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:31,332 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:31,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:31,333 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:31,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:31,397 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:31,879 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:31,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:32,135 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:32,480 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:32,511 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:33,136 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 18:11:33,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:33,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2020-12-09 18:11:33,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44043289] [2020-12-09 18:11:33,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 18:11:33,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 18:11:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=789, Unknown=2, NotChecked=114, Total=992 [2020-12-09 18:11:33,139 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 32 states. [2020-12-09 18:11:33,631 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_53 Int) (v_DerPreprocessor_126 Int)) (or (not (= c_ULTIMATE.start_sll_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_53 v_DerPreprocessor_126) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_53))) (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) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1)) is different from false [2020-12-09 18:11:34,032 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_ULTIMATE.start_main_~i~0) (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)))) (= c_ULTIMATE.start_main_~i~0 0) (<= c_ULTIMATE.start_main_~i~0 0) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_53 Int) (v_DerPreprocessor_126 Int)) (or (not (= c_ULTIMATE.start_main_~s~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_53 v_DerPreprocessor_126) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_53)))) is different from false [2020-12-09 18:11:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:34,467 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-12-09 18:11:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 18:11:34,467 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 20 [2020-12-09 18:11:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:34,468 INFO L225 Difference]: With dead ends: 26 [2020-12-09 18:11:34,468 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 18:11:34,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=197, Invalid=1455, Unknown=4, NotChecked=324, Total=1980 [2020-12-09 18:11:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 18:11:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-12-09 18:11:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-09 18:11:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-12-09 18:11:34,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2020-12-09 18:11:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:34,474 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-12-09 18:11:34,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 18:11:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-12-09 18:11:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 18:11:34,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:34,475 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:34,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:34,676 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1008242795, now seen corresponding path program 2 times [2020-12-09 18:11:34,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:34,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281113030] [2020-12-09 18:11:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:11:34,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281113030] [2020-12-09 18:11:34,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307029529] [2020-12-09 18:11:34,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:34,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 18:11:34,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:11:34,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 18:11:34,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:34,831 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 18:11:34,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:34,849 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 18:11:34,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [652298889] [2020-12-09 18:11:34,850 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 18:11:34,850 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:34,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:11:34,851 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:11:34,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:11:34,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:35,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:35,406 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:35,653 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:36,359 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:36,393 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:11:37,103 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 18:11:37,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:37,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2020-12-09 18:11:37,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524552406] [2020-12-09 18:11:37,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 18:11:37,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 18:11:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:11:37,104 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2020-12-09 18:11:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:37,153 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-12-09 18:11:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 18:11:37,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 18:11:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:37,154 INFO L225 Difference]: With dead ends: 22 [2020-12-09 18:11:37,154 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 18:11:37,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:11:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 18:11:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 18:11:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 18:11:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 18:11:37,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-12-09 18:11:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:37,155 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 18:11:37,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 18:11:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 18:11:37,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 18:11:37,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:37,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 18:11:40,924 WARN L197 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 176 DAG size of output: 133 [2020-12-09 18:11:41,379 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 117 [2020-12-09 18:11:42,002 WARN L197 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2020-12-09 18:11:52,748 WARN L197 SmtUtils]: Spent 10.75 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-12-09 18:11:53,115 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2020-12-09 18:11:53,582 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-12-09 18:11:53,585 INFO L265 CegarLoopResult]: At program point L572(line 572) the Hoare annotation is: true [2020-12-09 18:11:53,585 INFO L258 CegarLoopResult]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse35 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse31 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse35)) (.cse32 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse35))) (let ((.cse34 (select (select |#memory_int| .cse31) .cse32)) (.cse33 (+ ULTIMATE.start_main_~len~0 1))) (let ((.cse0 (<= .cse34 .cse33)) (.cse1 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse2 (= 2 ULTIMATE.start_main_~len~0)) (.cse3 (<= .cse33 .cse34)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse5 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (= |#t~string1.offset| 0)) (.cse9 (<= 0 |#t~string0.base|)) (.cse11 (<= .cse33 ULTIMATE.start_sll_update_at_~data)) (.cse10 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse12 (<= ULTIMATE.start_main_~data~0 1)) (.cse13 (= |#NULL.base| 0)) (.cse14 (<= 1 ULTIMATE.start_main_~data~0)) (.cse15 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse16 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse17 (<= ULTIMATE.start_sll_create_~data 1)) (.cse18 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse19 (<= ULTIMATE.start_sll_update_at_~data .cse33)) (.cse20 (<= 0 |#t~string1.base|)) (.cse21 (= .cse32 ULTIMATE.start_sll_update_at_~head.offset)) (.cse22 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse23 (= ULTIMATE.start_sll_update_at_~head.base .cse31)) (.cse24 (<= ULTIMATE.start_sll_create_~len 2)) (.cse25 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse26 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse27 (not (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base))) (.cse28 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse29 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse30 (= |#t~string0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_main_~s~0.offset) .cse5 (<= ULTIMATE.start_main_~s~0.offset 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_main_~i~0 0) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) 0)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse24 (<= 2 ULTIMATE.start_main_~i~0) .cse25 .cse26 .cse28 .cse29 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10 .cse12 .cse13 (<= ULTIMATE.start_sll_get_data_at_~index 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= 1 ULTIMATE.start_main_~i~0) .cse28 .cse29 .cse30)))))) [2020-12-09 18:11:53,585 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 18:11:53,585 INFO L265 CegarLoopResult]: At program point L631(lines 613 632) the Hoare annotation is: true [2020-12-09 18:11:53,586 INFO L258 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse28 (select |#memory_int| ULTIMATE.start_main_~s~0.base))) (let ((.cse0 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse1 (= 2 ULTIMATE.start_main_~len~0)) (.cse2 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse3 (<= ULTIMATE.start_sll_create_~len 0)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 0 |#StackHeapBarrier|)) (.cse6 (= |#t~string1.offset| 0)) (.cse7 (<= 0 |#t~string0.base|)) (.cse8 (let ((.cse30 (= ULTIMATE.start_sll_create_~head~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse31 (= |ULTIMATE.start_sll_update_at_#in~head.offset| ULTIMATE.start_sll_update_at_~head.offset)) (.cse32 (= ULTIMATE.start_main_~new_data~0 (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0))) (.cse33 (= ULTIMATE.start_sll_update_at_~index |ULTIMATE.start_sll_update_at_#in~index|)) (.cse34 (= ULTIMATE.start_main_~s~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse35 (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_sll_update_at_~head.base)) (.cse36 (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_main_~s~0.base)) (.cse37 (= |ULTIMATE.start_sll_update_at_#in~data| ULTIMATE.start_sll_update_at_~data)) (.cse38 (= ULTIMATE.start_main_~s~0.offset |ULTIMATE.start_sll_create_#res.offset|)) (.cse39 (= ULTIMATE.start_main_~i~0 |ULTIMATE.start_sll_update_at_#in~index|)) (.cse40 (= ULTIMATE.start_sll_create_~head~0.offset |ULTIMATE.start_sll_create_#res.offset|)) (.cse41 (= ULTIMATE.start_main_~new_data~0 |ULTIMATE.start_sll_update_at_#in~data|)) (.cse42 (= |ULTIMATE.start_sll_update_at_#in~head.offset| ULTIMATE.start_main_~s~0.offset))) (or (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (= ULTIMATE.start_main_~len~0 (select .cse28 ULTIMATE.start_main_~s~0.offset)) .cse42 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~len~0)) (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= ULTIMATE.start_main_~i~0 0) .cse39 .cse40 .cse41 .cse42)))) (.cse9 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse10 (<= ULTIMATE.start_main_~data~0 1)) (.cse11 (= |#NULL.base| 0)) (.cse12 (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))) (.cse13 (<= 1 ULTIMATE.start_main_~data~0)) (.cse14 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse15 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse16 (<= ULTIMATE.start_sll_create_~data 1)) (.cse17 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse18 (<= 0 |#t~string1.base|)) (.cse19 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse20 (<= ULTIMATE.start_sll_create_~len 2)) (.cse21 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse22 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse29 (<= 1 ULTIMATE.start_main_~i~0)) (.cse23 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse24 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse25 (= |#t~string0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_sll_update_at_~data 2) .cse25) (let ((.cse26 (+ ULTIMATE.start_main_~len~0 1)) (.cse27 (+ ULTIMATE.start_main_~s~0.offset 4))) (and .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_main_~s~0.offset) (<= ULTIMATE.start_main_~s~0.offset 0) (<= ULTIMATE.start_sll_update_at_~index 0) .cse4 .cse5 .cse6 .cse7 (<= .cse26 ULTIMATE.start_sll_update_at_~data) .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_sll_update_at_~data .cse26) .cse17 .cse18 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse27) ULTIMATE.start_sll_update_at_~head.offset) (= ULTIMATE.start_sll_update_at_~head.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse27)) .cse19 .cse20 (= 2 (select .cse28 0)) .cse21 .cse22 (not (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (<= ULTIMATE.start_main_~i~0 1) .cse29 .cse23 .cse24 .cse25)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29 .cse23 .cse24 .cse25)))) [2020-12-09 18:11:53,586 INFO L262 CegarLoopResult]: For program point L624(lines 624 626) no Hoare annotation was computed. [2020-12-09 18:11:53,586 INFO L258 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse41 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse37 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse41)) (.cse38 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse41))) (let ((.cse40 (select (select |#memory_int| .cse37) .cse38)) (.cse39 (+ ULTIMATE.start_main_~len~0 1))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse1 (<= .cse40 .cse39)) (.cse2 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse3 (<= .cse39 .cse40)) (.cse4 (= 2 ULTIMATE.start_main_~len~0)) (.cse5 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse6 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (<= 0 |#StackHeapBarrier|)) (.cse9 (= |#t~string1.offset| 0)) (.cse10 (<= 0 |#t~string0.base|)) (.cse11 (<= .cse39 ULTIMATE.start_sll_update_at_~data)) (.cse12 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse13 (<= ULTIMATE.start_main_~data~0 1)) (.cse14 (= |#NULL.base| 0)) (.cse15 (<= 1 ULTIMATE.start_main_~data~0)) (.cse16 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse17 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse18 (<= ULTIMATE.start_sll_create_~data 1)) (.cse19 (<= ULTIMATE.start_sll_update_at_~data .cse39)) (.cse20 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse21 (<= 0 |#t~string1.base|)) (.cse22 (= .cse38 ULTIMATE.start_sll_update_at_~head.offset)) (.cse23 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse24 (= ULTIMATE.start_sll_update_at_~head.base .cse37)) (.cse25 (<= ULTIMATE.start_sll_create_~len 2)) (.cse26 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse27 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse28 (not (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base))) (.cse29 (<= ULTIMATE.start_main_~i~0 1)) (.cse30 (<= 1 ULTIMATE.start_main_~i~0)) (.cse31 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse32 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse33 (= |#t~string0.offset| 0))) (or (and (<= ULTIMATE.start_main_~expected~0 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse0 ULTIMATE.start_main_~expected~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_sll_get_data_at_~index 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and (<= ULTIMATE.start_main_~expected~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ULTIMATE.start_main_~s~0.offset) (= 2 .cse0) .cse6 (<= ULTIMATE.start_main_~s~0.offset 0) .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse13 .cse14 (<= 2 ULTIMATE.start_main_~expected~0) .cse15 .cse16 .cse17 (= ULTIMATE.start_sll_get_data_at_~index 0) .cse18 .cse20 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 (= ULTIMATE.start_main_~i~0 0) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) 0)) .cse26 .cse27 .cse28 .cse31 .cse32 .cse33 (= ULTIMATE.start_sll_get_data_at_~head.offset 0)) (let ((.cse36 (+ ULTIMATE.start_sll_get_data_at_~head.offset 4))) (let ((.cse34 (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_get_data_at_~head.base) .cse36))) (let ((.cse35 (select (select |#memory_int| .cse34) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_get_data_at_~head.base) .cse36)))) (and .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_sll_get_data_at_~index) .cse5 .cse6 (not (= ULTIMATE.start_sll_get_data_at_~head.base .cse34)) .cse7 .cse8 (<= ULTIMATE.start_sll_get_data_at_~index 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ULTIMATE.start_main_~expected~0 .cse35) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= .cse35 ULTIMATE.start_main_~expected~0) .cse33))))))))) [2020-12-09 18:11:53,586 INFO L258 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2020-12-09 18:11:53,586 INFO L258 CegarLoopResult]: At program point L576(lines 576 578) the Hoare annotation is: (and (let ((.cse26 (select |#memory_int| |#t~string0.base|))) (let ((.cse0 (= ULTIMATE.start_main_~data~0 1)) (.cse1 (= (select .cse26 |#t~string0.offset|) 48)) (.cse2 (= (select |#valid| 0) 0)) (.cse3 (= ULTIMATE.start_sll_create_~data |ULTIMATE.start_sll_create_#in~data|)) (.cse4 (= ULTIMATE.start_main_~data~0 |ULTIMATE.start_sll_create_#in~data|)) (.cse5 (= 8 (select |#length| |ULTIMATE.start_node_create_#t~malloc5.base|))) (.cse6 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse7 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (= (select |#valid| |#t~string1.base|) 1)) (.cse10 (< |ULTIMATE.start_node_create_#t~malloc5.base| |#StackHeapBarrier|)) (.cse11 (= |#t~string1.offset| 0)) (.cse12 (= ULTIMATE.start_main_~len~0 |ULTIMATE.start_sll_create_#in~len|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (= 0 |ULTIMATE.start_node_create_#t~malloc5.offset|)) (.cse15 (= 19 (select |#length| |#t~string1.base|))) (.cse16 (= (select .cse26 (+ |#t~string0.offset| 1)) 0)) (.cse17 (= ULTIMATE.start_node_create_~data |ULTIMATE.start_node_create_#in~data|)) (.cse18 (= 2 (select |#length| |#t~string0.base|))) (.cse19 (= (select |#valid| |ULTIMATE.start_node_create_#t~malloc5.base|) 1)) (.cse20 (= ULTIMATE.start_sll_create_~data |ULTIMATE.start_node_create_#in~data|)) (.cse21 (= (select |#valid| |#t~string0.base|) 1)) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse23 (= |ULTIMATE.start_node_create_#t~malloc5.base| ULTIMATE.start_node_create_~temp~0.base)) (.cse24 (= |#t~string0.offset| 0))) (or (and .cse0 (= ULTIMATE.start_sll_create_~head~0.offset 0) (= |ULTIMATE.start_sll_create_#in~len| ULTIMATE.start_sll_create_~len) .cse1 .cse2 (= 2 ULTIMATE.start_main_~len~0) .cse3 .cse4 (= ULTIMATE.start_sll_create_~head~0.base 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse25 (+ ULTIMATE.start_sll_create_~new_head~0.offset 4))) (and .cse0 (= ULTIMATE.start_sll_create_~head~0.offset ULTIMATE.start_sll_create_~new_head~0.offset) (= (select |#valid| ULTIMATE.start_sll_create_~new_head~0.base) 1) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_create_~new_head~0.base) .cse25) 0) (not (= |ULTIMATE.start_node_create_#t~malloc5.base| ULTIMATE.start_sll_create_~new_head~0.base)) .cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~new_head~0.base) .cse25) 0) .cse4 (< ULTIMATE.start_sll_create_~new_head~0.base |#StackHeapBarrier|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 8 (select |#length| ULTIMATE.start_sll_create_~new_head~0.base)) .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_sll_create_~len) .cse16 .cse17 (= (+ ULTIMATE.start_sll_create_~len 1) |ULTIMATE.start_sll_create_#in~len|) .cse18 .cse19 .cse20 (= ULTIMATE.start_sll_create_~head~0.base ULTIMATE.start_sll_create_~new_head~0.base) (= ULTIMATE.start_sll_create_~new_head~0.offset 0) .cse21 (= ULTIMATE.start_sll_create_~data (select (select |#memory_int| ULTIMATE.start_sll_create_~new_head~0.base) ULTIMATE.start_sll_create_~new_head~0.offset)) .cse22 .cse23 .cse24))))) (= ULTIMATE.start_node_create_~temp~0.offset 0) (<= |ULTIMATE.start_sll_create_#in~len| 2)) [2020-12-09 18:11:53,586 INFO L265 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2020-12-09 18:11:53,587 INFO L258 CegarLoopResult]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse14 (<= 0 ULTIMATE.start_sll_create_~len)) (.cse15 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse16 (<= ULTIMATE.start_sll_create_~data 1)) (.cse2 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse6 (<= ULTIMATE.start_sll_update_at_~index 0)) (.cse5 (<= 0 ULTIMATE.start_main_~s~0.offset)) (.cse12 (<= ULTIMATE.start_main_~data~0 1)) (.cse13 (<= 1 ULTIMATE.start_main_~data~0)) (.cse17 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse3 (= 2 ULTIMATE.start_main_~len~0)) (.cse18 (<= 0 |#t~string1.base|)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse21 (<= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse10 (<= 0 |#t~string0.base|)) (.cse11 (<= 2 |ULTIMATE.start_sll_create_#in~len|)) (.cse7 (<= ULTIMATE.start_main_~s~0.offset 0)) (.cse22 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse23 (<= 0 ULTIMATE.start_sll_create_~head~0.offset)) (.cse8 (= |#NULL.offset| 0)) (.cse24 (<= |ULTIMATE.start_sll_create_#in~len| 2)) (.cse25 (<= |ULTIMATE.start_sll_create_#in~data| 1)) (.cse26 (= |#t~string0.offset| 0)) (.cse9 (<= 0 |#StackHeapBarrier|))) (or (let ((.cse27 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse20 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse27)) (.cse19 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse27))) (let ((.cse0 (select (select |#memory_int| .cse20) .cse19)) (.cse1 (+ ULTIMATE.start_main_~len~0 1))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse1 .cse0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |#t~string1.offset| 0) .cse10 .cse11 (<= .cse1 ULTIMATE.start_sll_update_at_~data) .cse12 (= |#NULL.base| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_sll_update_at_~data .cse1) .cse18 (= .cse19 ULTIMATE.start_sll_update_at_~head.offset) (= ULTIMATE.start_sll_update_at_~head.base .cse20) .cse21 (<= ULTIMATE.start_sll_create_~len 2) (<= 2 ULTIMATE.start_main_~i~0) (= 2 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) 0)) .cse22 (not (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) .cse23 .cse24 .cse25 .cse26)))) (and (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)) .cse14 .cse15 .cse16 .cse2 (let ((.cse29 (<= |#t~string1.offset| 0)) (.cse28 (<= |#NULL.base| 0)) (.cse30 (<= ULTIMATE.start_sll_create_~len 0)) (.cse31 (<= 0 |#t~string1.offset|)) (.cse32 (<= 0 |#NULL.base|))) (or (and (<= 2 ULTIMATE.start_main_~new_data~0) (<= |ULTIMATE.start_sll_update_at_#in~head.offset| 0) .cse28 .cse12 .cse13 (<= 2 |ULTIMATE.start_sll_update_at_#in~data|) (<= 0 ULTIMATE.start_sll_update_at_~index) (<= 0 |ULTIMATE.start_sll_update_at_#in~head.offset|) (<= |ULTIMATE.start_sll_update_at_#in~data| 2) (<= |ULTIMATE.start_sll_update_at_#in~index| 0) .cse29 (<= 0 ULTIMATE.start_sll_update_at_~head.offset) (<= ULTIMATE.start_sll_update_at_~data 2) (<= 0 |ULTIMATE.start_sll_update_at_#in~index|) .cse5 .cse30 (<= ULTIMATE.start_sll_update_at_~head.offset 0) .cse6 (<= ULTIMATE.start_main_~new_data~0 2) (<= ULTIMATE.start_main_~i~0 1) (<= 1 ULTIMATE.start_main_~i~0) .cse31 .cse32 (<= 2 ULTIMATE.start_sll_update_at_~data)) (and (<= 0 ULTIMATE.start_main_~i~0) .cse29 (<= ULTIMATE.start_main_~i~0 0) .cse5 .cse28 .cse12 .cse30 .cse13 .cse31 .cse32))) .cse17 .cse3 .cse18 .cse4 .cse21 (let ((.cse33 (= ULTIMATE.start_sll_create_~head~0.base |ULTIMATE.start_sll_create_#res.base|)) (.cse34 (= ULTIMATE.start_sll_create_~head~0.offset |ULTIMATE.start_sll_create_#res.offset|)) (.cse35 (= ULTIMATE.start_main_~s~0.base |ULTIMATE.start_sll_create_#res.base|))) (or (and .cse10 .cse33 (= ULTIMATE.start_main_~i~0 0) .cse11 .cse34 .cse35) (and .cse10 .cse33 .cse11 .cse34 (= 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 (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_sll_update_at_~head.base) (= |ULTIMATE.start_sll_update_at_#in~head.base| ULTIMATE.start_main_~s~0.base)))) .cse7 .cse22 .cse23 .cse8 .cse24 .cse25 .cse26 .cse9))) [2020-12-09 18:11:53,587 INFO L258 CegarLoopResult]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse6 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse12 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse14 (<= ULTIMATE.start_sll_create_~len 2)) (.cse15 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.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)) (.cse8 (<= ULTIMATE.start_sll_create_~data 1)) (.cse7 (<= 1 ULTIMATE.start_sll_create_~data)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_#in~data|)) (.cse11 (<= 0 |#t~string1.base|)) (.cse10 (= 2 ULTIMATE.start_main_~len~0)) (.cse13 (<= ULTIMATE.start_sll_create_~head~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 (<= 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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ULTIMATE.start_sll_create_~len) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_53 Int) (v_DerPreprocessor_126 Int)) (or (not (= ULTIMATE.start_sll_create_~head~0.base (select (store (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_53 v_DerPreprocessor_126) (+ ULTIMATE.start_sll_create_~head~0.offset 4)))) (< ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_53))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ULTIMATE.start_sll_create_~len) .cse8 .cse7 .cse9 .cse11 .cse10 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2020-12-09 18:11:53,587 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2020-12-09 18:11:53,587 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 18:11:53,594 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,594 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,595 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,607 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,608 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,608 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,608 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_126,QUANTIFIED] [2020-12-09 18:11:53,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_126,QUANTIFIED] [2020-12-09 18:11:53,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,628 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,629 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,639 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,639 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,640 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,640 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:11:53 BoogieIcfgContainer [2020-12-09 18:11:53,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:11:53,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:11:53,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:11:53,645 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:11:53,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:10:43" (3/4) ... [2020-12-09 18:11:53,647 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 18:11:53,654 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-12-09 18:11:53,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-12-09 18:11:53,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 18:11:53,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 18:11:53,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((1 <= len && "sll2n_update_all.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.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.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && (forall v_ULTIMATE.start_sll_update_at_~head.offset_53 : int, v_DerPreprocessor_126 : int :: !(head == #memory_$Pointer$[head][v_ULTIMATE.start_sll_update_at_~head.offset_53 := v_DerPreprocessor_126][head + 4]) || head < v_ULTIMATE.start_sll_update_at_~head.offset_53)) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((("sll2n_update_all.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 2 == len) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && 2 == len) && head <= 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) [2020-12-09 18:11:53,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((data == 1 && head == 0) && \old(len) == len) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && 2 == len) && data == \old(data)) && data == \old(data)) && head == 0) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all.c") && #NULL == 0) && \valid["sll2n_update_all.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && len == \old(len)) && #NULL == 0) && 0 == malloc(sizeof(struct node))) && 19 == unknown-#length-unknown["sll2n_update_all.c"]) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && data == \old(data)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) && "0" == 0) || ((((((((((((((((((((((((((((((((((((data == 1 && head == new_head) && \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)) && data == \old(data)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && data == \old(data)) && new_head < unknown-#StackHeapBarrier-unknown) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all.c") && #NULL == 0) && \valid["sll2n_update_all.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && len == \old(len)) && 8 == unknown-#length-unknown[new_head]) && #NULL == 0) && 0 == malloc(sizeof(struct node))) && 19 == unknown-#length-unknown["sll2n_update_all.c"]) && 0 < len) && 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) && \valid["0"] == 1) && data == unknown-#memory_int-unknown[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) && "0" == 0)) && temp == 0) && \old(len) <= 2 [2020-12-09 18:11:53,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && 0 <= s) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= 2) && 2 <= i) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && !(s == head)) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || (((((((((((((((((((!(#memory_$Pointer$[head][head + 4] == head) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= data) && ((((((((((((((((((((((((2 <= new_data && head <= 0) && #NULL <= 0) && data <= 1) && 1 <= data) && 2 <= \old(data)) && 0 <= index) && 0 <= head) && \old(data) <= 2) && \old(index) <= 0) && "sll2n_update_all.c" <= 0) && 0 <= head) && data <= 2) && 0 <= \old(index)) && 0 <= s) && len <= 0) && head <= 0) && index <= 0) && new_data <= 2) && i <= 1) && 1 <= i) && 0 <= "sll2n_update_all.c") && 0 <= #NULL) && 2 <= data) || (((((((((0 <= i && "sll2n_update_all.c" <= 0) && i <= 0) && 0 <= s) && #NULL <= 0) && data <= 1) && len <= 0) && 1 <= data) && 0 <= "sll2n_update_all.c") && 0 <= #NULL))) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all.c") && \valid[temp] == 1) && head <= 0) && ((((((0 <= "0" && head == \result) && i == 0) && 2 <= \old(len)) && head == \result) && s == \result) || (((((((0 <= "0" && head == \result) && 2 <= \old(len)) && head == \result) && data == unknown-#memory_int-unknown[head][head]) && s == \result) && head == head) && head == s))) && s <= 0) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) [2020-12-09 18:11:53,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && 0 <= s) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && i == 0) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || ((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && 2 <= i) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0)) || ((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && temp == 0) && 0 <= head) && !(s == head)) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) [2020-12-09 18:11:53,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && (((((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == \old(index)) && head == \result) && new_data == \old(data)) && len == unknown-#memory_int-unknown[s][s]) && head == s) && i < len) || (((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == 0) && i == \old(index)) && head == \result) && new_data == \old(data)) && head == s))) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && !(#memory_$Pointer$[head][head + 4] == head)) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && data == 2) && "0" == 0) || (((((((((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && 0 <= s) && s <= 0) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= 2) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0)) || ((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && (((((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == \old(index)) && head == \result) && new_data == \old(data)) && len == unknown-#memory_int-unknown[s][s]) && head == s) && i < len) || (((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == 0) && i == \old(index)) && head == \result) && new_data == \old(data)) && head == s))) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && !(#memory_$Pointer$[head][head + 4] == head)) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) [2020-12-09 18:11:53,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((expected <= unknown-#memory_int-unknown[head][head] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1) && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && \valid[temp] == 1) && index <= 0) && unknown-#memory_int-unknown[head][head] <= expected) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || (((((((((((((((((((((((((((((((((((((((expected <= 2 && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1) && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && \valid[temp] == 1) && 0 <= s) && 2 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 2 <= expected) && 1 <= data) && 0 <= len) && \valid[head] == 1) && index == 0) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && i == 0) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && head == 0)) || (((((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && 1 <= index) && \valid[temp] == 1) && index <= 0) && !(head == #memory_$Pointer$[head][head + 4])) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && index <= 1) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && "0" == 0) [2020-12-09 18:11:53,681 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3821a9b8-3081-4625-8b5c-2723cddae17d/bin/utaipan/witness.graphml [2020-12-09 18:11:53,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:11:53,682 INFO L168 Benchmark]: Toolchain (without parser) took 71198.64 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 73.2 MB in the beginning and 185.3 MB in the end (delta: -112.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,682 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 111.1 MB. Free memory is still 90.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:11:53,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.52 ms. Allocated memory is still 111.1 MB. Free memory was 73.1 MB in the beginning and 74.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.74 ms. Allocated memory is still 111.1 MB. Free memory was 74.3 MB in the beginning and 72.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,682 INFO L168 Benchmark]: Boogie Preprocessor took 29.56 ms. Allocated memory is still 111.1 MB. Free memory was 72.2 MB in the beginning and 70.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,683 INFO L168 Benchmark]: RCFGBuilder took 387.19 ms. Allocated memory is still 111.1 MB. Free memory was 70.4 MB in the beginning and 79.4 MB in the end (delta: -9.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,683 INFO L168 Benchmark]: TraceAbstraction took 70409.82 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 79.4 MB in the beginning and 188.5 MB in the end (delta: -109.0 MB). Peak memory consumption was 142.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,683 INFO L168 Benchmark]: Witness Printer took 37.19 ms. Allocated memory is still 234.9 MB. Free memory was 188.5 MB in the beginning and 185.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:53,683 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.12 ms. Allocated memory is still 111.1 MB. Free memory is still 90.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 299.52 ms. Allocated memory is still 111.1 MB. Free memory was 73.1 MB in the beginning and 74.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.74 ms. Allocated memory is still 111.1 MB. Free memory was 74.3 MB in the beginning and 72.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.56 ms. Allocated memory is still 111.1 MB. Free memory was 72.2 MB in the beginning and 70.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 387.19 ms. Allocated memory is still 111.1 MB. Free memory was 70.4 MB in the beginning and 79.4 MB in the end (delta: -9.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 70409.82 ms. Allocated memory was 111.1 MB in the beginning and 234.9 MB in the end (delta: 123.7 MB). Free memory was 79.4 MB in the beginning and 188.5 MB in the end (delta: -109.0 MB). Peak memory consumption was 142.2 MB. Max. memory is 16.1 GB. * Witness Printer took 37.19 ms. Allocated memory is still 234.9 MB. Free memory was 188.5 MB in the beginning and 185.3 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$.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$.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$.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$.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$.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_DerPreprocessor_126,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,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_126,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 - 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 18:11:53,686 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && 0 <= s) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= 2) && 2 <= i) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && !(s == head)) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || (((((((((((((((((((!(#memory_$Pointer$[head][head + 4] == head) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= data) && ((((((((((((((((((((((((2 <= new_data && head <= 0) && #NULL <= 0) && data <= 1) && 1 <= data) && 2 <= \old(data)) && 0 <= index) && 0 <= head) && \old(data) <= 2) && \old(index) <= 0) && "sll2n_update_all.c" <= 0) && 0 <= head) && data <= 2) && 0 <= \old(index)) && 0 <= s) && len <= 0) && head <= 0) && index <= 0) && new_data <= 2) && i <= 1) && 1 <= i) && 0 <= "sll2n_update_all.c") && 0 <= #NULL) && 2 <= data) || (((((((((0 <= i && "sll2n_update_all.c" <= 0) && i <= 0) && 0 <= s) && #NULL <= 0) && data <= 1) && len <= 0) && 1 <= data) && 0 <= "sll2n_update_all.c") && 0 <= #NULL))) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all.c") && \valid[temp] == 1) && head <= 0) && ((((((0 <= "0" && head == \result) && i == 0) && 2 <= \old(len)) && head == \result) && s == \result) || (((((((0 <= "0" && head == \result) && 2 <= \old(len)) && head == \result) && data == unknown-#memory_int-unknown[head][head]) && s == \result) && head == head) && head == s))) && s <= 0) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 607]: Loop Invariant [2020-12-09 18:11:53,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && (((((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == \old(index)) && head == \result) && new_data == \old(data)) && len == unknown-#memory_int-unknown[s][s]) && head == s) && i < len) || (((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == 0) && i == \old(index)) && head == \result) && new_data == \old(data)) && head == s))) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && !(#memory_$Pointer$[head][head + 4] == head)) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && data == 2) && "0" == 0) || (((((((((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && 0 <= s) && s <= 0) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head == #memory_$Pointer$[s][s + 4]) && head <= 0) && len <= 2) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0)) || ((((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && len <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && (((((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == \old(index)) && head == \result) && new_data == \old(data)) && len == unknown-#memory_int-unknown[s][s]) && head == s) && i < len) || (((((((((((((head == \result && head == head) && new_data == len + i) && index == \old(index)) && s == \result) && head == head) && head == s) && \old(data) == data) && s == \result) && i == 0) && i == \old(index)) && head == \result) && new_data == \old(data)) && head == s))) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && !(#memory_$Pointer$[head][head + 4] == head)) && 1 <= data) && \valid[head] == 1) && 0 <= len) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && temp == 0) && 0 <= head) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "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 18:11:53,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_126,QUANTIFIED] [2020-12-09 18:11:53,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,696 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_126,QUANTIFIED] [2020-12-09 18:11:53,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] [2020-12-09 18:11:53,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head.offset_53,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((1 <= len && "sll2n_update_all.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.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.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && 1 <= data) && data <= 1) && 1 <= \old(data)) && 2 == len) && 0 <= "sll2n_update_all.c") && \valid[temp] == 1) && head <= 0) && len <= 2) && (forall v_ULTIMATE.start_sll_update_at_~head.offset_53 : int, v_DerPreprocessor_126 : int :: !(head == #memory_$Pointer$[head][v_ULTIMATE.start_sll_update_at_~head.offset_53 := v_DerPreprocessor_126][head + 4]) || head < v_ULTIMATE.start_sll_update_at_~head.offset_53)) && temp == 0) && 0 <= head) && #NULL == 0) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((("sll2n_update_all.c" == 0 && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 2 == len) && data <= 1) && 1 <= data) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && 2 == len) && head <= 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 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((expected <= unknown-#memory_int-unknown[head][head] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1) && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && \valid[temp] == 1) && index <= 0) && unknown-#memory_int-unknown[head][head] <= expected) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || (((((((((((((((((((((((((((((((((((((((expected <= 2 && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1) && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && \valid[temp] == 1) && 0 <= s) && 2 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 2 <= expected) && 1 <= data) && 0 <= len) && \valid[head] == 1) && index == 0) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && i == 0) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) && head == 0)) || (((((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && 2 == len) && 1 <= index) && \valid[temp] == 1) && index <= 0) && !(head == #memory_$Pointer$[head][head + 4])) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && index <= 1) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && data <= len + 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && 0 <= head) && !(s == head)) && i <= 1) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && "0" == 0) - InvariantResult [Line: 622]: Loop Invariant [2020-12-09 18:11:53,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && 0 <= s) && index <= 0) && s <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && len + 1 <= data) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && i == 0) && 2 == unknown-#memory_int-unknown[s][0]) && temp == 0) && 0 <= head) && !(s == head)) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) || ((((((((((((((((((((((((1 <= data && 2 == len) && \valid[temp] == 1) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && 2 <= \old(len)) && data <= 1) && #NULL == 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && 0 <= "sll2n_update_all.c") && head <= 0) && len <= 2) && 2 <= i) && temp == 0) && 0 <= head) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0)) || ((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 1 <= data) && 2 == len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && \valid[temp] == 1) && index <= 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && 0 <= "0") && len + 1 <= data) && 2 <= \old(len)) && data <= 1) && #NULL == 0) && index <= 0) && 1 <= data) && 0 <= len) && \valid[head] == 1) && data <= 1) && 1 <= \old(data)) && data <= len + 1) && 0 <= "sll2n_update_all.c") && #memory_$Pointer$[s][s + 4] == head) && head <= 0) && head == #memory_$Pointer$[s][s + 4]) && len <= 2) && temp == 0) && 0 <= head) && !(s == head)) && 1 <= i) && \old(len) <= 2) && \old(data) <= 1) && "0" == 0) - InvariantResult [Line: 576]: Loop Invariant [2020-12-09 18:11:53,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 18:11:53,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 18:11:53,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((data == 1 && head == 0) && \old(len) == len) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && 2 == len) && data == \old(data)) && data == \old(data)) && head == 0) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all.c") && #NULL == 0) && \valid["sll2n_update_all.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && len == \old(len)) && #NULL == 0) && 0 == malloc(sizeof(struct node))) && 19 == unknown-#length-unknown["sll2n_update_all.c"]) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && data == \old(data)) && 2 == unknown-#length-unknown["0"]) && \valid[malloc(sizeof(struct node))] == 1) && data == \old(data)) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) && "0" == 0) || ((((((((((((((((((((((((((((((((((((data == 1 && head == new_head) && \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)) && data == \old(data)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && data == \old(data)) && new_head < unknown-#StackHeapBarrier-unknown) && 8 == unknown-#length-unknown[malloc(sizeof(struct node))]) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "sll2n_update_all.c") && #NULL == 0) && \valid["sll2n_update_all.c"] == 1) && malloc(sizeof(struct node)) < unknown-#StackHeapBarrier-unknown) && "sll2n_update_all.c" == 0) && len == \old(len)) && 8 == unknown-#length-unknown[new_head]) && #NULL == 0) && 0 == malloc(sizeof(struct node))) && 19 == unknown-#length-unknown["sll2n_update_all.c"]) && 0 < len) && 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) && \valid["0"] == 1) && data == unknown-#memory_int-unknown[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && malloc(sizeof(struct node)) == temp) && "0" == 0)) && temp == 0) && \old(len) <= 2 - 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: 54.0s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 118 SDtfs, 328 SDslu, 293 SDs, 0 SdLazy, 879 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 320 SyntacticMatches, 17 SemanticMatches, 198 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 33.1s 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, 45 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 2378 HoareAnnotationTreeSize, 10 FomulaSimplifications, 7428 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 4049 FormulaSimplificationTreeSizeReductionInter, 16.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 497 ConstructedInterpolants, 10 QuantifiedInterpolants, 51702 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1932 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 271/371 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]: 3947, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 24, TOOLS_POST_TIME[ms]: 3484, 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: 24, TOOLS_QUANTIFIERELIM_TIME[ms]: 3475, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 802, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 50, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME[ms]: 197, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME[ms]: 182, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME[ms]: 13, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME[ms]: 33, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2258, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2257, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, 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]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 9, DAG_COMPRESSION_PROCESSED_NODES: 286, DAG_COMPRESSION_RETAINED_NODES: 59, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...