./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:42:20,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:42:20,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:42:20,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:42:20,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:42:20,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:42:20,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:42:20,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:42:20,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:42:20,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:42:20,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:42:20,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:42:20,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:42:20,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:42:20,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:42:20,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:42:20,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:42:20,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:42:20,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:42:20,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:42:20,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:42:20,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:42:20,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:42:20,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:42:20,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:42:20,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:42:20,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:42:20,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:42:20,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:42:20,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:42:20,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:42:20,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:42:20,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:42:20,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:42:20,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:42:20,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:42:20,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:42:20,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:42:20,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:42:20,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:42:20,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:42:20,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:42:21,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:42:21,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:42:21,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:42:21,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:42:21,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:42:21,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:42:21,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:42:21,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:42:21,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:42:21,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:42:21,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:42:21,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:42:21,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:42:21,028 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:42:21,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:42:21,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:42:21,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:42:21,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:42:21,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:42:21,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:42:21,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:42:21,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:42:21,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:42:21,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:42:21,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:42:21,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:42:21,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:42:21,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:42:21,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2019-11-15 21:42:21,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:42:21,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:42:21,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:42:21,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:42:21,088 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:42:21,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2019-11-15 21:42:21,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/data/16e518631/99d5841d11994687bace9db4a2b55a9a/FLAG0545086dd [2019-11-15 21:42:21,600 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:42:21,601 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/sv-benchmarks/c/forester-heap/dll-01-1.i [2019-11-15 21:42:21,616 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/data/16e518631/99d5841d11994687bace9db4a2b55a9a/FLAG0545086dd [2019-11-15 21:42:21,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/data/16e518631/99d5841d11994687bace9db4a2b55a9a [2019-11-15 21:42:21,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:42:21,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:42:21,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:42:21,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:42:21,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:42:21,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:21" (1/1) ... [2019-11-15 21:42:21,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15242ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:21, skipping insertion in model container [2019-11-15 21:42:21,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:21" (1/1) ... [2019-11-15 21:42:21,992 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:42:22,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:42:22,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:42:22,511 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:42:22,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:42:22,630 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:42:22,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22 WrapperNode [2019-11-15 21:42:22,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:42:22,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:42:22,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:42:22,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:42:22,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:42:22,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:42:22,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:42:22,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:42:22,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... [2019-11-15 21:42:22,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:42:22,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:42:22,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:42:22,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:42:22,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/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 [2019-11-15 21:42:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:42:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:42:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:42:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:42:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:42:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:42:23,420 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:42:23,420 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-15 21:42:23,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:23 BoogieIcfgContainer [2019-11-15 21:42:23,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:42:23,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:42:23,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:42:23,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:42:23,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:42:21" (1/3) ... [2019-11-15 21:42:23,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a735057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:42:23, skipping insertion in model container [2019-11-15 21:42:23,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:22" (2/3) ... [2019-11-15 21:42:23,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a735057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:42:23, skipping insertion in model container [2019-11-15 21:42:23,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:23" (3/3) ... [2019-11-15 21:42:23,431 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2019-11-15 21:42:23,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:42:23,451 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-15 21:42:23,465 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-15 21:42:23,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:42:23,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:42:23,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:42:23,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:42:23,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:42:23,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:42:23,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:42:23,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:42:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-11-15 21:42:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-15 21:42:23,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:23,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-15 21:42:23,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-15 21:42:23,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:23,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558924267] [2019-11-15 21:42:23,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:23,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:23,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:23,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558924267] [2019-11-15 21:42:23,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:23,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:23,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231137127] [2019-11-15 21:42:23,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:42:23,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:23,735 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-11-15 21:42:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:23,821 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-11-15 21:42:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:23,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-15 21:42:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:23,835 INFO L225 Difference]: With dead ends: 180 [2019-11-15 21:42:23,835 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 21:42:23,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 21:42:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-11-15 21:42:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 21:42:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-15 21:42:23,901 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2019-11-15 21:42:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:23,902 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-15 21:42:23,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:42:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-15 21:42:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:42:23,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:23,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:23,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-15 21:42:23,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:23,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129399100] [2019-11-15 21:42:23,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:23,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:23,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:23,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129399100] [2019-11-15 21:42:23,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:23,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:23,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522618647] [2019-11-15 21:42:23,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:42:23,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:23,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:23,988 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2019-11-15 21:42:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:24,007 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-15 21:42:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:24,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 21:42:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:24,009 INFO L225 Difference]: With dead ends: 80 [2019-11-15 21:42:24,010 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 21:42:24,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 21:42:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-15 21:42:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 21:42:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-15 21:42:24,019 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2019-11-15 21:42:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:24,019 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-15 21:42:24,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:42:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-15 21:42:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:42:24,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:24,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:24,021 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-15 21:42:24,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:24,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543848203] [2019-11-15 21:42:24,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:24,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543848203] [2019-11-15 21:42:24,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:24,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:42:24,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756542967] [2019-11-15 21:42:24,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:42:24,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:42:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:24,101 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2019-11-15 21:42:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:24,200 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-11-15 21:42:24,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:42:24,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:42:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:24,202 INFO L225 Difference]: With dead ends: 79 [2019-11-15 21:42:24,203 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 21:42:24,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 21:42:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-15 21:42:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 21:42:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-11-15 21:42:24,212 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2019-11-15 21:42:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:24,212 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-11-15 21:42:24,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:42:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-11-15 21:42:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:42:24,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:24,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:24,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-15 21:42:24,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:24,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929044322] [2019-11-15 21:42:24,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:24,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929044322] [2019-11-15 21:42:24,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:24,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:42:24,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412302323] [2019-11-15 21:42:24,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:42:24,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:42:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:24,300 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2019-11-15 21:42:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:24,488 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2019-11-15 21:42:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:42:24,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 21:42:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:24,490 INFO L225 Difference]: With dead ends: 195 [2019-11-15 21:42:24,490 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 21:42:24,491 INFO L600 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 [2019-11-15 21:42:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 21:42:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2019-11-15 21:42:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 21:42:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-15 21:42:24,510 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2019-11-15 21:42:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:24,511 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-15 21:42:24,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:42:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-15 21:42:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:42:24,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:24,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:24,513 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2019-11-15 21:42:24,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:24,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356875850] [2019-11-15 21:42:24,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:24,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356875850] [2019-11-15 21:42:24,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:24,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:42:24,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798566806] [2019-11-15 21:42:24,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:42:24,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:42:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:42:24,655 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-11-15 21:42:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:24,855 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-15 21:42:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:42:24,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-15 21:42:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:24,858 INFO L225 Difference]: With dead ends: 122 [2019-11-15 21:42:24,858 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 21:42:24,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:42:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 21:42:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2019-11-15 21:42:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 21:42:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-11-15 21:42:24,874 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2019-11-15 21:42:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:24,874 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-11-15 21:42:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:42:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-11-15 21:42:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:42:24,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:24,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:24,877 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-15 21:42:24,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:24,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267177413] [2019-11-15 21:42:24,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:24,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:24,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267177413] [2019-11-15 21:42:24,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:24,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:42:24,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550746323] [2019-11-15 21:42:24,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:42:24,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:42:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:24,946 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2019-11-15 21:42:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:25,043 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-15 21:42:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:42:25,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-15 21:42:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:25,046 INFO L225 Difference]: With dead ends: 132 [2019-11-15 21:42:25,046 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 21:42:25,046 INFO L600 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 [2019-11-15 21:42:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 21:42:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2019-11-15 21:42:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 21:42:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-11-15 21:42:25,055 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2019-11-15 21:42:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:25,055 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-11-15 21:42:25,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:42:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-11-15 21:42:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:42:25,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:25,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:25,057 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2019-11-15 21:42:25,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:25,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783297461] [2019-11-15 21:42:25,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:25,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783297461] [2019-11-15 21:42:25,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:25,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:25,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067672742] [2019-11-15 21:42:25,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:42:25,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:25,092 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-11-15 21:42:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:25,117 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2019-11-15 21:42:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:25,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 21:42:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:25,119 INFO L225 Difference]: With dead ends: 137 [2019-11-15 21:42:25,119 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 21:42:25,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 21:42:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2019-11-15 21:42:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 21:42:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-11-15 21:42:25,129 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2019-11-15 21:42:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:25,129 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-11-15 21:42:25,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:42:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-11-15 21:42:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:42:25,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:25,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:25,131 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-15 21:42:25,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:25,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013753265] [2019-11-15 21:42:25,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:25,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013753265] [2019-11-15 21:42:25,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:25,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:25,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814011548] [2019-11-15 21:42:25,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:42:25,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:25,178 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-11-15 21:42:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:25,208 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-11-15 21:42:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:25,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:42:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:25,210 INFO L225 Difference]: With dead ends: 75 [2019-11-15 21:42:25,210 INFO L226 Difference]: Without dead ends: 73 [2019-11-15 21:42:25,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-15 21:42:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-15 21:42:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 21:42:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-15 21:42:25,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2019-11-15 21:42:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:25,220 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-15 21:42:25,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:42:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-15 21:42:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:42:25,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:25,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:25,223 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-15 21:42:25,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:25,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310707988] [2019-11-15 21:42:25,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:25,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310707988] [2019-11-15 21:42:25,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:25,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:42:25,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33195327] [2019-11-15 21:42:25,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:42:25,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:42:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:25,303 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-11-15 21:42:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:25,518 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-11-15 21:42:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:42:25,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-15 21:42:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:25,520 INFO L225 Difference]: With dead ends: 74 [2019-11-15 21:42:25,520 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 21:42:25,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:42:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 21:42:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-11-15 21:42:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 21:42:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-11-15 21:42:25,527 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2019-11-15 21:42:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-11-15 21:42:25,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:42:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-11-15 21:42:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:42:25,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:25,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:25,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-15 21:42:25,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:25,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620204187] [2019-11-15 21:42:25,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:25,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:25,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620204187] [2019-11-15 21:42:25,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:25,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:42:25,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959195482] [2019-11-15 21:42:25,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:42:25,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:42:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:42:25,646 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 6 states. [2019-11-15 21:42:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:26,006 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2019-11-15 21:42:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:42:26,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-15 21:42:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:26,010 INFO L225 Difference]: With dead ends: 175 [2019-11-15 21:42:26,010 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:42:26,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:42:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:42:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-11-15 21:42:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-15 21:42:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-11-15 21:42:26,022 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2019-11-15 21:42:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:26,023 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-11-15 21:42:26,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:42:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-11-15 21:42:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:42:26,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:26,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:26,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-15 21:42:26,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:26,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387871229] [2019-11-15 21:42:26,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:26,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:26,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:26,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387871229] [2019-11-15 21:42:26,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:26,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:42:26,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804497739] [2019-11-15 21:42:26,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:42:26,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:42:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:42:26,314 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 8 states. [2019-11-15 21:42:26,539 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 21:42:26,719 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-15 21:42:26,856 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-15 21:42:27,236 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 21:42:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:27,469 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2019-11-15 21:42:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:42:27,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-15 21:42:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:27,473 INFO L225 Difference]: With dead ends: 171 [2019-11-15 21:42:27,473 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:42:27,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:42:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:42:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2019-11-15 21:42:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 21:42:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2019-11-15 21:42:27,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 24 [2019-11-15 21:42:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:27,497 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2019-11-15 21:42:27,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:42:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2019-11-15 21:42:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:42:27,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:27,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:27,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2019-11-15 21:42:27,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:27,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153167163] [2019-11-15 21:42:27,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:42:27,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153167163] [2019-11-15 21:42:27,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:27,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:42:27,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473663148] [2019-11-15 21:42:27,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:42:27,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:42:27,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:42:27,602 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 5 states. [2019-11-15 21:42:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:27,767 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-11-15 21:42:27,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:42:27,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-15 21:42:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:27,769 INFO L225 Difference]: With dead ends: 146 [2019-11-15 21:42:27,769 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 21:42:27,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:42:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 21:42:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2019-11-15 21:42:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 21:42:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2019-11-15 21:42:27,778 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 26 [2019-11-15 21:42:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:27,779 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2019-11-15 21:42:27,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:42:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2019-11-15 21:42:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:42:27,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:27,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:27,781 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2019-11-15 21:42:27,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:27,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183134936] [2019-11-15 21:42:27,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:42:27,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183134936] [2019-11-15 21:42:27,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:27,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:27,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875576263] [2019-11-15 21:42:27,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:42:27,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:27,812 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 3 states. [2019-11-15 21:42:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:27,872 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-11-15 21:42:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:27,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:42:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:42:27,874 INFO L225 Difference]: With dead ends: 120 [2019-11-15 21:42:27,874 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 21:42:27,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 21:42:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-15 21:42:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 21:42:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-11-15 21:42:27,882 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 26 [2019-11-15 21:42:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:42:27,883 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-15 21:42:27,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:42:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-11-15 21:42:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:42:27,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:42:27,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:27,885 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:42:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-15 21:42:27,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:27,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905847348] [2019-11-15 21:42:27,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:27,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:27,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:27,957 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:42:28,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:42:28 BoogieIcfgContainer [2019-11-15 21:42:28,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:42:28,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:42:28,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:42:28,014 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:42:28,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:23" (3/4) ... [2019-11-15 21:42:28,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:42:28,073 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_62f9547e-47fc-42aa-9447-4afa8ca8b272/bin/uautomizer/witness.graphml [2019-11-15 21:42:28,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:42:28,084 INFO L168 Benchmark]: Toolchain (without parser) took 6109.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:42:28,085 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:42:28,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:42:28,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:42:28,088 INFO L168 Benchmark]: Boogie Preprocessor took 41.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:42:28,089 INFO L168 Benchmark]: RCFGBuilder took 679.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:42:28,089 INFO L168 Benchmark]: TraceAbstraction took 4590.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.0 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:42:28,090 INFO L168 Benchmark]: Witness Printer took 68.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:42:28,093 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 679.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4590.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.0 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Result: UNSAFE, OverallTime: 4.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 914 SDtfs, 940 SDslu, 1206 SDs, 0 SdLazy, 618 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 307 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 35681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...